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 241 – 260 of 1330

An adaptive $s$ -step conjugate gradient algorithm with dynamic basis updating

Erin Claire Carson (2020)

Applications of Mathematics

The adaptive $s$ -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive $s$ -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of $A$ , using a technique due to G. Meurant and P. Tichý (2018)....

An additive Schwarz method for mortar Morley finite element discretizations of 4th order elliptic problem in 2D.

Marcinkowski, Leszek (2007)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

An aggregation-based algebraic multigrid method.

Notay, Yvan (2010)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

An algebraic construction of discrete wavelet transforms

Jaroslav Kautský (1993)

Applications of Mathematics

Discrete wavelets are viewed as linear algebraic transforms given by banded orthogonal matrices which can be built up from small matrix blocks satisfying certain conditions. A generalization of the finite support Daubechies wavelets is discussed and some special cases promising more rapid signal reduction are derived.

An Algorithm for Best Approximate Solutions of Ax = b with a Smooth Strictly Convex Norm.

R.W. Owens (1977/1978)

Numerische Mathematik

An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric.

Richard S. Varga, Reinhard Nabben (1993)

Numerische Mathematik

An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.

M. von Golitschek (1980)

Numerische Mathematik

An algorithm for solving the absolute value equation.

Rohn, Jiri (2009)

ELA. The Electronic Journal of Linear Algebra [electronic only]

An algorithm for the inversion of partitioned matrices

Hana Kamasová (1970)

Aplikace matematiky

An algorithm that carries a square matrix into its transpose by an involutory congruence transformation.

Đoković, Dragomir Z̆., Szechtman, F., Zhao, K. (2003)

ELA. The Electronic Journal of Linear Algebra [electronic only]

An Algorithm to Compute a Sparse Basis of the Null Space.

M.W. Berry, M.T. Heath, I. Kaneko, ... (1985)

Numerische Mathematik

An alternating direction implicit method for orthogonal spline collocation linear systems.

Bernard Bialecki (1991)

Numerische Mathematik

An alternating-direction iteration method for Helmholtz problems

Jim Douglas, Jeffrey L. Hensley, Jean Elizabeth Roberts (1993)

Applications of Mathematics

An alternating-direction iterative procedure is described for a class of Helmholz-like problems. An algorithm for the selection of the iteration parameters is derived; the parameters are complex with some having positive real part and some negative, reflecting the noncoercivity and nonsymmetry of the finite element or finite difference matrix. Examples are presented, with an applications to wave propagation.

An Alternative Givens Ordering.

J.J. Modi, M.R.B. Clarke (1984)

Numerische Mathematik

An analysis of low-rank modifications of preconditioners for saddle point systems.

Greif, Chen, Overton, Michael L. (2010)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

An analysis of the composite step biconjugate gradient method.

Randolph E. Bank, Tony F. Chan (1993/1994)

Numerische Mathematik

An analysis of the pole placement problem I: The single-input case.

Mehrmann, Volker, Xu, Hongguo (1996)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

An analysis of the pole placement problem. II: The multi-input case.

Mehrmann, Volker, Xu, Hongguo (1997)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

An Analysis of the Shifted LR Algorithm.

T.J. DEKKER, J.F. TRAUE (1971)

Numerische Mathematik

An efficient algorithm for computing real powers of a matrix and a related matrix function

Jan Ježek (1988)

Aplikace matematiky

The paper is devoted to an algorithm for computing matrices $A^{r}$ and $(A^{r} - I) . {(A - I)}^{- 1}$ for a given square matrix $A$ and a real $r$ . The algorithm uses the binary expansion of $r$ and has the logarithmic computational complexity with respect to $r$ . The problem stems from the control theory.

Currently displaying 241 – 260 of 1330

Previous Page 13 Next