EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 821 – 840 of 1334

On the choice of iteration parameters in the Stone incomplete factorization

Karel Segeth (1983)

Aplikace matematiky

The paper is concerned with the iterative solution of sparse linear algebraic systems by the Stone incomplete factorization. For the sake of clarity, the algorithm of the Stone incomplete factorization is described and, moreover, some properties of the method are derived in the paper. The conclusion is devoted to a series of numerical experiments focused on the choice of iteration parameters in the Stone method. The model problem considered showe that we can, in general, choose appropriate values...

On the choice of subspace for iterative methods for linear discrete ill-posed problems

Daniela Calvetti, Bryan Lewis, Lothar Reichel (2001)

International Journal of Applied Mathematics and Computer Science

Many iterative methods for the solution of linear discrete ill-posed problems with a large matrix require the computed approximate solutions to be orthogonal to the null space of the matrix. We show that when the desired solution is not smooth, it may be possible to determine meaningful approximate solutions with less computational work by not imposing this orthogonality condition.

On the Computation of Inclusion Regions for Partitioned Matrices.

R.L. Johnston, D.D. Olesky (1972)

Numerische Mathematik

On the computation of the null space of Toeplitz-like matrices.

Mastronardi, Nicola, Van Barel, Marc, Vandebril, Raf (2008)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

On the computer algebra implementation of the least squares method on the nonnegative orthant.

Ikramov, Kh.D., Matin Far, M. (2004)

Zapiski Nauchnykh Seminarov POMI

On the Condition Number of some Gram Matrices Arising from Least Squares Approximation in the Complex Plane.

Youcef Saad (1986)

Numerische Mathematik

On the convergence of a modified block SOR algorithm.

Jovanović, Boško S. (1996)

Novi Sad Journal of Mathematics

On the convergence of a multicomponent alternating direction difference scheme.

Jovanović, Boško (1994)

Publications de l'Institut Mathématique. Nouvelle Série

On the convergence of a new Rayleigh quotient method with applications to large eigenproblems.

O'Leary, D.P., Stewart, G.W. (1998)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

On the Convergence of Multi-Grid Methods for a Hypersingular Integral Equation of the First Kind.

T. von Petersdorff, E.P. Stephan (1990)

Numerische Mathematik

On the Convergence of Powers of Interval Matrices (2).

Günter Mayer (1985)

Numerische Mathematik

On the Convergence of the Classical Jacobi Method for Real Symmetric Matrices with Non-Distinct Eigenvalues.

H.P.M. van KEMPEN (1966/1967)

Numerische Mathematik

On the Convergence of the Conjugate Gradient Method for Singular Capacitance Matrix Equations from the Neumann Problem of the Poisson Equation.

A.S.L. Shieh (1977/1978)

Numerische Mathematik

On the Convergence of the Symmetric SOR Method for Matrices with Red-Black Ordering.

G. Alefeld (1982)

Numerische Mathematik

On the convergence rate of the conjugate gradients in presence of rounding errors.

Yvan Notay (1993)

Numerische Mathematik

On the convergence theory of double $K$ -weak splittings of type II

Vaibhav Shekhar, Nachiketa Mishra, Debasisha Mishra (2022)

Applications of Mathematics

Recently, Wang (2017) has introduced the $K$ -nonnegative double splitting using the notion of matrices that leave a cone $K \subseteq ℝ^{n}$ invariant and studied its convergence theory by generalizing the corresponding results for the nonnegative double splitting by Song and Song (2011). However, the convergence theory for $K$ -weak regular and $K$ -nonnegative double splittings of type II is not yet studied. In this article, we first introduce this class of splittings and then discuss the convergence theory for these sub-classes...

Currently displaying 821 – 840 of 1334

Previous Page 42 Next

Displaying 821 – 840 of 1334

On the choice of iteration parameters in the Stone incomplete factorization

On the choice of subspace for iterative methods for linear discrete ill-posed problems

On the Computation of Inclusion Regions for Partitioned Matrices.

On the computation of the null space of Toeplitz-like matrices.

On the computer algebra implementation of the least squares method on the nonnegative orthant.

On the Condition Number of some Gram Matrices Arising from Least Squares Approximation in the Complex Plane.

On the convergence of a modified block SOR algorithm.

On the convergence of a multicomponent alternating direction difference scheme.

On the convergence of a new Rayleigh quotient method with applications to large eigenproblems.

On the Convergence of Multi-Grid Methods for a Hypersingular Integral Equation of the First Kind.

On the Convergence of Powers of Interval Matrices (2).

On the Convergence of the Classical Jacobi Method for Real Symmetric Matrices with Non-Distinct Eigenvalues.

On the Convergence of the Conjugate Gradient Method for Singular Capacitance Matrix Equations from the Neumann Problem of the Poisson Equation.

On the Convergence of the Symmetric SOR Method for Matrices with Red-Black Ordering.

On the convergence rate of the conjugate gradients in presence of rounding errors.

On the convergence theory of double $K$ -weak splittings of type II

On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic.

On the Direct Solution of Preconditioned Linear Equations

On the Distribution of Errors in the Iterative Solution of a System of Linear Equations. II..

On the Distribution of Errors in the Iterative Solution of a System of Linear Equations.

Currently displaying 821 – 840 of 1334