The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Nested Dissection of a Regular Finite Element Mesh
Abstract
Let M be a mesh consisting of $n^2 $ squares called elements, formed by subdividing the unit square $(0,1) \times (0,1)$ into $n^2 $ small squares of side ${1 / h}$, and having a node at each of the $(n + 1)^2 $ grid points. With M we associate the $N \times N$ symmetric positive definite system $Ax = b$, where $N = (n + 1)^2 $, each $x_i $ is associated with a node of M, and $A_{ij} \ne 0$ if and only if $x_i $ and $x_j $ are associated with nodes of the same element. If we solve the equations via the standard symmetric factorization of A, then $O(n^4 )$ arithmetic operations are required if the usual row by row (banded) numbering scheme is used, and the storage required is $O(n^3 )$. In this paper we present an unusual numbering of the mesh (unknowns) and show that if we avoid operating on zeros, the $LDL^T $ factorization of A can be computed using the same standard algorithm in $O(n^3 )$ arithmetic operations. Furthermore, the storage required is only $O(n^2 \log _2 n)$. Finally, we prove that all orderings of the mesh must yield an operation count of at least $O(n^3 )$, provided we use the standard factorization algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Bramble, J. H., & Varga, R. S. (1963) · Mathematics of Computation · doi:10.2307/2003862 · Cited by 4,091
Rose, D. J. (1972) · Elsevier eBooks · doi:10.1016/b978-1-4832-3187-7.50018-0 · Cited by 449
The Use of Linear Graphs in Gauss Elimination
Parter, S. (1961) · SIAM Review · doi:10.1137/1003021 · Cited by 290
The Direct Solution of the Discrete Poisson Equation on a Rectangle
Dorr, F. W. (1970) · SIAM Review · doi:10.1137/1012045 · Cited by 219
Cited by
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Kwant: a software package for quantum transport
Groth, C. W., Wimmer, M., Akhmerov, A. R., & Waintal, X. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/6/063065 · Cited by 1,263
Preconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
Algorithmic Aspects of Vertex Elimination on Graphs
Rose, D. J., Tarjan, R. E., & Lueker, G. S. (1976) · SIAM Journal on Computing · doi:10.1137/0205021 · Cited by 1,203
Applications of a Planar Separator Theorem
Lipton, R. J., & Tarjan, R. E. (1980) · SIAM Journal on Computing · doi:10.1137/0209046 · Cited by 640
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
Lipton, R. J., Rose, D. J., & Tarjan, R. E. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716027 · Cited by 560
An Introduction to Chordal Graphs and Clique Trees
Blair, J. R. S., & Peyton, B. (1993) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4613-8369-7_1 · Cited by 377
Solvers for the cardiac bidomain equations
Vigmond, E. J., Weber dos Santos, R., Prassl, A. J., Deo, M., & Plank, G. (2008) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2007.07.012 · Cited by 344
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
Parallel multilevel k-way partitioning scheme for irregular graphs
Karypis, G., & Kumar, V. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369103 · Cited by 310
Fast algorithms for hierarchically semiseparable matrices
Xia, J., Chandrasekaran, S., Gu, M., & Li, X. S. (2010) · Numerical Linear Algebra with Applications · doi:10.1002/nla.691 · Cited by 305
Multiresolution Markov models for signal and image processing
Willsky, A. S. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.800717 · Cited by 305
Fast solution methods in electromagnetics
Chew, W. C., Jin, J.-M., Lu, C.-C., Michielssen, E., & Song, J. M. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.558669 · Cited by 299
Minimizing Communication in Numerical Linear Algebra
Ballard, G., Demmel, J., Holtz, O., & Schwartz, O. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090769156 · Cited by 276
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Metadata
- Authors
- George, A.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1973-04
- Volume
- 10
- Issue
- 2
- Pages
- 345-363
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2137541800
- Cited by
- 1,064
- References
- 7
- FWCI
- 12.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.