Results 241 to 250 of about 139,083 (290)
Some of the next articles are maybe not open access.
2002
This survey paper gives the latest results on numerical accuracy and asymptotic convergence of various Jacobi-type methods.
Slapničar, Ivan +2 more
openaire +1 more source
This survey paper gives the latest results on numerical accuracy and asymptotic convergence of various Jacobi-type methods.
Slapničar, Ivan +2 more
openaire +1 more source
HOMOGENIZATION OF HAMILTON–JACOBI EQUATIONS: NUMERICAL METHODS
Mathematical Models and Methods in Applied Sciences, 2008We study approximation strategies for the limit problem arising in the homogenization of Hamilton–Jacobi equations. They involve first an approximation of the effective Hamiltonian then a discretization of the Hamilton–Jacobi equation with the approximate effective Hamiltonian.
CAMILLI, FABIO +2 more
openaire +2 more sources
CUDA-Based Jacobi's Iterative Method
2009 International Forum on Computer Science-Technology and Applications, 2009Solving linear equations is a common problem in the fields of science and engineering. Accelerating its solving process is of great significance. Modern GPUs are high performance many-core processors fit for large scale parallel computing. They provide us a novel way for accelerating the solving process.
Zhihui Zhang, Qinghai Miao, Ying Wang
openaire +1 more source
Jacobi’s Method for Skew-Symmetric Matrices
SIAM Journal on Matrix Analysis and Applications, 1993A formula is derived for a rotation matrix which reduces orthogonally a \(4\times 4\) real skew-symmetric matrix \(A\) to real Schur form. A Jacobi type method is used. By applying the \(4\times 4\) matrices the off- diagonal part of the matrix is annihilated.
openaire +2 more sources
Splitting methods for Hamilton‐Jacobi equations
Numerical Methods for Partial Differential Equations, 2005AbstractWe explain how the exploitation of several kinds of operator splitting methods, both local and global in time, lead to simple numerical schemes approximating the solution of nonlinear Hamilton‐Jacobi equations. We review the existing local methods which have been used since the early 80's and we introduce a new method which is global in time ...
openaire +1 more source
Accelerating the SVD Block-Jacobi Method
Computing, 2005The paper discusses how to improve performance of the one-sided block-Jacobi algorithm for computing the singular value decomposition of rectangular matrices. In particular, it is shown how cosine-sine decomposition of orthogonal matrices can be used to accelerate the slowest part of the algorithm – updating the block-columns.
openaire +2 more sources
Accurate Eigensystem Computations by Jacobi Methods
SIAM Journal on Matrix Analysis and Applications, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2013
In the preceding chapters, the predominant issues have been those connected with the deductive method: existence on the one hand, and the twin issues of regularity and necessary conditions on the other. We now introduce the reader to verification functions, a technique which unifies all the main inductive methods.
openaire +1 more source
In the preceding chapters, the predominant issues have been those connected with the deductive method: existence on the one hand, and the twin issues of regularity and necessary conditions on the other. We now introduce the reader to verification functions, a technique which unifies all the main inductive methods.
openaire +1 more source
Jacobi’s Method is More Accurate than QR
SIAM Journal on Matrix Analysis and Applications, 1992A new perturbation theory for eigenvalues and eigenvectors of symmetric definite matrices and matrix pencils is presented. It gives relative error bounds of the eigenvalues as well as of the components of the eigenvectors. Applying formal error analysis and numerical experiments the authors show that the Jacobi method to solve the eigenvalue problem ...
Demmel, James, Veselić, Krešimir
openaire +2 more sources
Numerical Stability of the Parallel Jacobi Method
SIAM Journal on Matrix Analysis and Applications, 2005The authors analyse the numerical stability of the parallel Jacobi method for computing the singular values and singular subspaces of an invertible upper triangular matrix obtained from QR decomposition with column pivoting. They show that in this case the parallel Jacobi method works with full machine accuracy, thus the computational errors are ...
Londre, T., Rhee, N. H.
openaire +2 more sources