New Parallel Algorithms for Direct Solution ofLinear Equations
Rights Contact Login For More Details
- Wiley
More About This Title New Parallel Algorithms for Direct Solution ofLinear Equations
English
Systems of linear equations arise frequently in engineering systems analysis, and methods of solving these systems are an increasing area of research required to improve speed, fault tolerance, and scalability. This book presents new research in the area of solving linear equations. Readers will find that instead of "parallelizing" the usual algorithms, the authors have developed new ones.
English
Parallel Computational Model and Algorithm Design Issues.
Bidirectional Gaussian Elimination.
Bidirectional LU Factorization.
Bidirectional Householder Reductions and Modified Gram-Schmidt Orthogonalization.
Bidirectional Givens Rotations.
Bidirectional Sparse Cholesky Factorization.
Bidirectional Sparse Factorization.
Bidirectional Elimination Algorithms Revisited.
Appendices.
Bibliography.
Index.
Bidirectional Gaussian Elimination.
Bidirectional LU Factorization.
Bidirectional Householder Reductions and Modified Gram-Schmidt Orthogonalization.
Bidirectional Givens Rotations.
Bidirectional Sparse Cholesky Factorization.
Bidirectional Sparse Factorization.
Bidirectional Elimination Algorithms Revisited.
Appendices.
Bibliography.
Index.
English
"Three noted Computer scientists survey these methods, and present a novel approach, using a bidirectional elimination solver." (SciTech Book News Vol. 25, No. 2 June 2001)
