𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel computation of a Krylov matrix for a sparse and structured input

✍ Scribed by V.Y. Pan

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
204 KB
Volume
21
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Block computation and representation of
Block computation and representation of a sparse nullspace basis of a rectangular matrix
✍ Sabine Le Borne πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

In this paper, we propose a new method to efficiently compute a representation of an orthogonal basis of the nullspace of a sparse matrix operator B T with B ∈ R nΓ—m , n > m. We assume that B has full rank, i.e., rank(B) = m. It is well known that the last nm columns of the orthogonal matrix Q in a

A new parallel sparse direct solver: Pre
A new parallel sparse direct solver: Presentation and numerical experiments in large-scale structural mechanics parallel computing
✍ I. GuΓ¨ye; S. El Arem; F. Feyel; F.-X. Roux; G. Cailletaud πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract The main purpose of this work is to present a new parallel direct solver: __Dissection__ solver. It is based on __LU__ factorization of the sparse matrix of the linear system and allows to detect automatically and handle properly the zero‐energy modes, which are important when dealing w