Results 61 to 70 of about 34,257 (101)
PROTO-PLASM: parallel language for adaptive and scalable modelling of biosystems. [PDF]
Philos Trans A Math Phys Eng Sci, 2008 Bajaj C, DiCarlo A, Paoluzzi A.
europepmc +1 more source
, 2023 We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the theory of ...
Tsujimoto, Satoshi +2 more
core
Transformation of a matrix to bidiagonal form
, 2006 : In the present work we si udy algorithms lo transform matrix to bidiagonal shape with usage of Householder..
Kubásek, Petr
core
Methods of Graph Decompositions [PDF]
In general terms, a graph decomposition is a partition of a graph into parts satisfying some special conditions. Methods of Graph Decompositions discusses some state-of-the-art decomposition methods of graph theory, which are highly instrumental when ...
Zverovich, Vadim, Skums, Pavel
core
Efficient Parallel Reduction to Bidiagonal Form
, 1998 Most methods for calculating the SVD (singular value decomposition) require to first bidiagonalize the matrix. The blocked reduction of a general, dense matrix to bidiagonal form, as implemented in ScaLAPACK, does about one half of the operations with ...
Lang, B. +3 more
core
Studies on Accurate Singular Value Decomposition for Bidiagonal Matrices
Studies on Accurate Singular Value Decomposition for Bidiagonal Matrices原著論文リスト[A1]: “The final publication is available at Springer via http://dx.doi.org/10.1007/s11075-012-9607-5.”. [A2]: “The final publication is available at Springer via http://dx.doi.org/10.1007/s10092-013-0085-5.”, [A3]: DOI“10.1016/j.camwa.2015.11.022”
openaire +1 more source
Accurately Counting Singular Values of Bidiagonal Matrices
, 1998 We have developed algorithms to count singular values of a bidiagonal matrix which are greater than a specified value. This requires the transformation of the singular value problem to an equivalent symmetric eigenvalue problem.
K.V. Fernando
core
A Superintegrable Quantum Field Theory. [PDF]
Commun Math PhysDe Clerck M, Evnin O.
europepmc +1 more source
Bounds for the Error of Some Parallel Bidiagonal Solvers for Strictly Diagonal Dominant Systems
, 1994 In this paper, the numerical aspects of some methods for the solution of bidiagonal systems are analyzed. We suppose that the systems are strictly diagonal dominant.
Juan J. Navarro +2 more
core
RELIABLE SOLUTION OF BIDIAGONAL SYSTEMS WITH APPLICATIONS
, 1999 We show that the stability of Gaussian elimination with partial pivoting relates to the well definition of the reduced triangular systems. We develop refined perturbation bounds that generalize Skeel bounds to the case of ill conditioned systems.
I. BAR ON, LEONCINI, Mauro
core