Elimination on sparse symmetric systems of a special structure
Jitka Segethová (1972)
Aplikace matematiky
Similarity:
Jitka Segethová (1972)
Aplikace matematiky
Similarity:
František Mikloško (1978)
Banach Center Publications
Similarity:
Ljiljana Cvetković, Vladimir Kostić, Maja Nedović (2015)
Open Mathematics
Similarity:
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...
Dedó, E., Marini, A., Salvi, N.Z. (2003)
Mathematica Pannonica
Similarity:
Stuart, Jeffrey L. (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Miroslav Tůma (1988)
Aplikace matematiky
Similarity:
Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.
Krzysztof Janiszowski (2003)
International Journal of Applied Mathematics and Computer Science
Similarity:
An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced...
Mario Guarracino, Francesca Perla, Paolo Zanetti (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation of some eigenvalues of a large sparse symmetric matrix. It implements an efficient and portable Block Lanczos algorithm for distributed memory multicomputers. HPEC is based on basic linear algebra operations for sparse and dense matrices, some of which have been derived by ScaLAPACK library modules. Numerical experiments have been carried out to evaluate HPEC...