Hamburger Beiträge zur Angewandten Mathematik

نویسنده

  • Gerhard Opfer
چکیده

The well known conjugate gradient algorithm (cg-algorithm), introduced by Hestenes & Stiefel, [1952] intended for real, symmetric, positive definite matrices works as well for complex matrices and has the same typical convergence behavior. It will also work, not generally, but in many cases for hermitean, but not necessarily positive definite matrices. We shall show, that the same behavior is still valid if we apply the cg-algorithm to matrices with quaternion entries. We particularly investigate the early stop of the cg-algorithm in this case and we develop error estimates. We have to present some basic facts about quaternions and about matrices with quaternion entries, in particular, about eigenvalues of such matrices. We also present some numerical examples of quaternion systems solved by the cg-algorithm.

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

ثبت نام

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

منابع مشابه

Hamburger Beiträge zur Angewandten Mathematik Variational Discretization of Lavrentiev - Regularized State Constrained Elliptic Control Problems

In the present work, we apply a variational discretization proposed by the first author in [14] to Lavrentiev-regularized state constrained elliptic control problems. We extend the results of [18] and prove weak convergence of the adjoint states and multipliers of the regularized problems to their counterparts of the original problem. Further, we prove error estimates for finite element discret...

متن کامل

Hamburger Beiträge zur Angewandten Mathematik

We consider a simplified accoustic model to describe nonlinear phenomena occuring in loudspeakers. The simplification is that we restrict to the one–dimensional isentropic Euler equations in a slab, where on the right end a membrane is moving periodically with frequency ω and maximal displacement ε œ 1. The asymptotic model based on the small parameter ε yields hyperbolic first order systems, w...

متن کامل

Hamburger Beitrage zur Angewandten Mathematik Beyond Montonicity in Regularization Methods for Nonlinear Complementarity Problems

Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004