When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited.
Sparse Matrix Computations
โ Scribed by James R. Bunch, Donald J. Rose
- Publisher
- Elsevier Inc, Academic Press Inc
- Year
- 1976
- Tongue
- English
- Leaves
- 436
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Content:
Academic Press Rapid Manuscript Reproduction, Page ii
Front Matter, Page iii
Copyright, Page iv
Contributors, Pages ix-x
Preface, Page xi, J.R. Bunch, D.J. Rose
GRAPH THEORY AND GAUSSIAN ELIMINATION, Pages 3-22, ROBERT ENDRE TARJAN
PARTITIONING USING PAQ, Pages 23-37, Thomas D. Howell
BLOCK METHODS FOR SOLVING SPARSE LINEAR SYSTEMS, Pages 39-58, James R. Bunch
A Recursive Analysis of Dissection Strategies, Pages 59-83, DONALD J. ROSE, GREGORY F. WHITTEN
Applications of an Element Model for Gaussian Elimination, Pages 85-96, S.C. EISENSTAT, M.H. SCHULTZ, A.H. SHERMAN
AN OPTIMIZATION PROBLEM ARISING FROM TEARING METHODS, Pages 97-110, Alberto Sangiovanni-Vincentelli
A BIBLIOGRAPHICAL TOUR OF THE LARGE, SPARSE GENERALIZED EIGENVALUE PROBLEM, Pages 113-130, G.W. Stewart
HOW FAR SHOULD YOU GO WITH THE LANCZOS PROCESS?, Pages 131-144, W. KAHAN, B.N. PARLETT
OPTIMIZATION FOR SPARSE SYSTEMS, Pages 147-176, T.L. Magnanti
METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS, Pages 177-199, ร
KE BJรRCK
THE ORTHOGONAL FACTORIZATION OF A LARGE SPARSE MATRIX, Pages 201-212, Philip E. Gill, Walter Murray
A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING, Pages 213-226, Michael A. Saunders
USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMS, Pages 227-240, D. Goldfarb
SPARSE MATRIX SOFTWARE, Pages 243-261, W. Morven Gentleman, Alan George
CONSIDERATIONS IN THE DESIGN OF SOFTWARE FOR SPARSE GAUSSIAN ELIMINATION, Pages 263-273, S.C. Eisenstat, M.H. Schultz, A.H. Sherman
FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX, Pages 275-289, Fred Gustavson
Marching Algorithms and Block Gaussian Elimination, Pages 293-307, Randolph E. Bank
A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS, Pages 309-332, Paul Concus, Gene H. Golub, Dianne P. O'Leary
Preconditioned Conjugate Gradient Iteration Applied to Galerkin Methods for a Mildly Nonlinear Dirichlet Problem, Pages 333-348, Jim Douglas Jr., Todd Dupont
THE SPARSE TABLEAU APPROACH TO FINITE ELEMENT ASSEMBLY, Pages 349-363, GARY HACHTEL
A CAPACITANCE MATRIX TECHNIQUE, Pages 365-373, B.L. Buzbee
M-Matrix Theory and Recent Results in Numerical Linear Algebra, Pages 375-387, Richard S. Varga
Sparse Matrix Problems in a Finite Element Open Ocean Model, Pages 391-407, Joel E. Hirsh, William L. Briggs
CALCULATION OF NORMAL MODES OF OCEANS USING A LANCZOS METHOD, Pages 409-426, Alan K. Cline, Gene H. Golub, George W. Platzman
APPLICATION OF SPARSE MATRIX TECHNIQUES TO RESERVOIR SIMULATION, Pages 427-438, P.T. Woo, S.C. Eisenstat, M.H. Schultz, A.H. Sherman
On the Origins and Numerical Solution of Some Sparse Nonlinear Systems, Pages 439-453, T.A. Porsching
๐ SIMILAR VOLUMES
<P>In recent years several new classes of matrices have been discovered and their structure exploited to design fast and accurate algorithms. In this new reference work, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi present the first comprehensive overview of the mathematical and numerical p
<P>In recent years several new classes of matrices have been discovered and their structure exploited to design fast and accurate algorithms. In this new reference work, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi present the first comprehensive overview of the mathematical and numerical p