Finite element least-squares methods for a compressible Stokes system.
Displaying 81 – 100 of 183
Gaussian Elimination is not Optimal.
V. STRASSEN (1969)
Numerische Mathematik
General theory of direct methods for solving systems of equations with band matrices
Ľubor Malina (1979)
Aplikace matematiky
A unified approach to the theory and construction of direct methods is presented. The approach is based on the idea of the transfer of conditions. In examples it is shown how to obtain a particular method from the general algorithm.
Generalizations of Nekrasov matrices and applications
Ljiljana Cvetković, Vladimir Kostić, Maja Nedović (2015)
Open Mathematics
In this paper we present a nonsingularity result which is a generalization of Nekrasov property by using two different permutations of the index set. The main motivation comes from the following observation: matrices that are Nekrasov matrices up to the same permutations of rows and columns, are nonsingular. But, testing all the permutations of the index set for the given matrix is too expensive. So, in some cases, our new nonsingularity criterion allows us to use the results already calculated...
Image restoration through subimages and confidence images.
Nagy, James G., O'Leary, Dianne P. (2002)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Index Transforms for Multidimensional DFT's and Convolutions.
Gabriele Steidl, Manfred Tasche (1989/1990)
Numerische Mathematik
Index Transforms for N-dimensional DFT's.
Josef Hekrdla (1987)
Numerische Mathematik
Inertias and ranks of some Hermitian matrix functions with applications
Xiang Zhang, Qing-Wen Wang, Xin Liu (2012)
Open Mathematics
Let S be a given set consisting of some Hermitian matrices with the same size. We say that a matrix A ∈ S is maximal if A − W is positive semidefinite for every matrix W ∈ S. In this paper, we consider the maximal and minimal inertias and ranks of the Hermitian matrix function f(X,Y) = P − QXQ* − TYT*, where * means the conjugate and transpose of a matrix, P = P*, Q, T are known matrices and for X and Y Hermitian solutions to the consistent matrix equations AX =B and YC = D respectively. As applications,...
Interval solutions of linear interval equations
Jiří Rohn (1990)
Aplikace matematiky
It is shown that if the concept of an interval solution to a system of linear interval equations given by Ratschek and Sauer is slightly modified, then only two nonlinear equations are to be solved to find a modified interval solution or to verify that no such solution exists.
Inverse eigenvalue problem for periodic block Jacobi matrices
W. Karczewski (1987)
Applicationes Mathematicae
Iterative methods for the numerical solution of the boundary value problem of elasticity [Abstract of thesis]
R. Blahata (1988)
Commentationes Mathematicae Universitatis Carolinae
Iterative Nachverbesserung mit Fehlereingrenzung der Cholesky-Faktoren von Stieltjes-Matrizen.
J.W. Schmidt, U. Patzke (1981)
Journal für die reine und angewandte Mathematik
Joint domain-decomposition -LU preconditioners for saddle point problems.
Le Borne, Sabine, Oliveira, Suely (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Krein spaces numerical ranges and their computer generation.
Bebiano, Natalia, da Providência, Joao, Nata, Ana Cristina, Pereira Soares, Maria da Graca (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Large-scale Kalman filtering using the limited memory BFGS method.
Auvinen, H., Bardsley, J.M., Haario, H., Kauranne, T. (2009)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Least squares (P,Q)-orthogonal symmetric solutions of the matrix equation and its optimal approximation.
Zhao, Lin-Lin, Chen, Guo-Linag, Liu, Qing-Bin (2010)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Linear transforms and convolution
Ladislav Skula (1987)
Mathematica Slovaca
Linear transforms supporting circular convolution on residue class rings
Ladislav Skula (1989)
Mathematica Slovaca
Look-ahead Levinson- and Schur-type recurrences in the Padé table.
Gutknecht, Martin H., Hochbruck, Marlis (1994)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Low rank Tucker-type tensor approximation to classical potentials
B. Khoromskij, V. Khoromskaia (2007)
Open Mathematics
This paper investigates best rank-(r 1,..., r d) Tucker tensor approximation of higher-order tensors arising from the discretization of linear operators and functions in ℝd. Super-convergence of the best rank-(r 1,..., r d) Tucker-type decomposition with respect to the relative Frobenius norm is proven. Dimensionality reduction by the two-level Tucker-to-canonical approximation is discussed. Tensor-product representation of basic multi-linear algebra operations is considered, including inner, outer...