Approximate iterations for structured matrices
نویسندگان
چکیده
منابع مشابه
Approximate iterations for structured matrices
Important matrix-valued functions f(A) are, e.g., the inverse A−1, the square root √ A, the sign function and the exponent. Their evaluation for large matrices arising from pdes is not an easy task and needs techniques exploiting appropriate structures of the matrices A and f(A) (often f(A) possesses this structure only approximately). However, intermediate matrices arising during the evaluatio...
متن کاملThe unitary completion and QR iterations for a class of structured matrices
We consider the problem of completion of a matrix with a specified lower triangular part to a unitary matrix. In this paper we obtain the necessary and sufficient conditions of existence of a unitary completion without any additional constraints and give a general formula for this completion. The paper is mainly focused on matrices with the specified lower triangular part of a special form. For...
متن کاملApproximate Inverse Preconditioners via Sparse-Sparse Iterations
The standard incomplete LU (ILU) preconditioners often fail for general sparse in-deenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI ? AMk F , where AM is the preconditioned matrix. An iterative descent-type met...
متن کاملOn the Qr Iterations of Real Matrices
We answer a question of D. Serre on the QR iterations of a real matrix with nonreal eigenvalues whose moduli are distinct except for the conjugate pairs. Numerical experiments by MATLAB are performed.
متن کاملApproximate Nullspace Iterations for Kkt Systems in Model Based Optimization
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuracies are not increased when zooming in to the solution of an optimization problem. Only linear-quadratic problems are treated, where approximate reduced SQP methods can be viewed as null-space iterations for KKT systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2008
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-008-0143-0