LQ-Schur projection on large sparse matrix equations

نویسندگان

  • Daniel Boley
  • Todd Goehring
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Acceleration Procedure for the Spectral Element Ocean Model Formulation of the Shallow Water Equations

We develop an overlapping block preconditioner based on an additive Schwarz method for preconditioning the system of equations arising from discretizing the shallow water equations using the spectral ocean element method approach. The system is complicated by being sparse, but having a very large number of nonzeroes in any row of the matrix, which is never stored. The resulting coupled system o...

متن کامل

Applying Schur Complements for Handling General Updates of a Large, Sparse, Unsymmetric Matrix

We describe a set of procedures for computing and updating an inverse representation of a large and sparse unsymmetric matrix A. The representation is built of two matrices: an easily invertible, large and sparse matrix A0 and a dense Schur complement matrix S. An e cient heuristic is given that nds this representation for any matrix A and keeps the size of S as small as possible. Equations wit...

متن کامل

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...

متن کامل

An approximate cyclic reduction multilevel preconditioner for general sparse matrices

We discuss an iterative method for solving large sparse systems of equations. A hybrid method is introduced which uses ideas both from ILU preconditioning and from multigrid. The resulting preconditioning technique requires the matrix only. A multilevel structure is obtained by using maximal independent sets for graph coarsening. For Schur complement approximation on coarser graphs an incomplet...

متن کامل

Applying Schur Complements for Handling

We describe a set of procedures for computing and updating an inverse representation of a large and sparse unsymmetric matrix A. The representation is built of two matrices: an easily invertible, large and sparse matrix A 0 and a dense Schur complement matrix S. An eecient heuristic is given that nds this representation for any matrix A and keeps the size of S as small as possible. Equations wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2000