Titlebook: Computer Algorithms for Solving Linear Algebraic Equations; The State of the Art Emilio Spedicato Conference proceedings 1991 Springer-Verl

Irremediable

同音

A Splitting Method for Large Sparse Linear Systems on a Multivector Computer,rix is symmetric positive definite, ?good? estimates for the iterative parameters have been obtained. In this case, also, a polynomial acceleration of the method has been considered. The results of some computational experiments on CRAY Y-MP have been reported.

蝕刻術(shù)

Scheduling Parallel Factorization Algorithms on a Shared Memory Computer,equential algorithm. We then apply these tools to Gauss-Jordan method, several Gaussian elimination algorithms, Cholesky decomposition and Doolittle reduction and QR factorization. In a second part, we examine the parallelization of Givens factorization and review several complexity results.

foreign

famine

Clumsy

榨取

Classical Methods for Linear Equations,tions plus divisions is a polynomial in .. If . is large the amount of work required to solve equation (1.1) will depend essentially on the leading term of this polynomial and we shall denote that term by μ. Thus, for a particular method, μ is a rough measure of the time taken by a computer to solve equation (1.1) for a given size of matrix ..

mechanical

調(diào)整

兩棲動物

Algorithms for Linear Least Squares Problems,ation bounds based on componentwise perturbations in the data are given. The SVD is expensive to compute, and for large sparse problems is not a practical alternative. We discuss two recent algorithms for numerically rank deficient problems based instead on the QR factorization..New backward stable