Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Computer solution of large sparse positive definite systems
- J. Pasciak, A. George, J. Liu
- Mathematics
- 1 July 1982
Nested Dissection of a Regular Finite Element Mesh
- A. George
- Mathematics
- 1 April 1973
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… Expand
The Evolution of the Minimum Degree Ordering Algorithm
TLDR
Solution of sparse linear least squares problems using givens rotations
Abstract We describe a direct method for solving sparse linear least squares problems. The storage required for the method is no more than that needed for the conventional normal equations approach.… Expand
An Implementation of a Pseudoperipheral Node Finder
TLDR
AN ANALYSIS OF SPECTRAL ENVELOPE-REDUCTION VIA QUADRATIC ASSIGNMENT PROBLEMS
A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described in [Barnard, Pothen, and Simon, Numer. Linear Algebra Appl., 2 (1995), pp. 317--334]. The… Expand
Communication results for parallel sparse Cholesky factorization on a hypercube
TLDR
Solution of sparse positive definite systems on a hypercube
The solution of large sparse positive definite systems of equations typically involves four steps: ordering, data structure set-up (symbolic factorization), numerical factorization, and triangular… Expand
Sparse Cholesky factorization on a local-memory multiprocessor
TLDR
...
1
2
3
4
5
...