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

Cerumen

Paul J. J. Welfens,Andreas SchwarzIn this paper we present the main properties of the class of direct methods for solving linear equations proposed by Abaffy, Broyden and Spedicato in 1984 and called the ABS class.

量被毀壞

Fibrin

IVORY

Connecting the Testbench and Design,We deal with the implementation of linear algebra algorithms on distributed memory architectures such as systolic arrays and general-purpose hypercubes. Throughout, we use Gaussian elimination as a target example.

蓋他為秘密

ethnology

Multi-Grid Algorithms,Multi-grid methods belong to the class of the fastest iterations, since their convergence rate is independent of the step size .. Their applicability does not require symmetry or positive definiteness. Further, it is easy to generalise multi-grid methods to nonlinear problems.

malapropism

Two Multi-Level Methods for Nonuniformly Refined Grids,The hierarchical basis method and the recent method of Bramble, Pasciak and Xu are multi-level type methods which are especially well suited for nonuniformely refined grids. The paper gives a short summary of these methods.

手勢

Memorial

礦石

Algorithms for Linear Least Squares Problems,al equations ..(.) = 0 and preconditioned are surveyed. In least squares problems arising from multidimensional models the matrices often possess a block structure, perhaps at several levels, which reflects a “l(fā)ocal connection” structure in the underlying physical problem. For such problems parallel