Esta é uma implementação feita em C do método de Gauss-Jacobi para resolução de sistemas lineares aplicando concorrência através da utilização da biblioteca pthread. O programa principal "gauss-jacobi ...
Write A = I + L + U, where I is an identity matrix L is lower triangular matrix with diagonal entries 0 U is upper triangular matrix with diagonal entries 0 Ax = (I + L + U)x = b xk+1 = -Lxk – Uxk + b ...
Abstract: One or 2-step Gauss-Jacobi method is efficiently incorporated to the large scale interconnect analysis. In order to make the Gauss-Jacobi method within 1 or 2 iterations during each time ...
Abstract: In the paper there are presented efficient and accurate methods of Gauss-Jacobi nodes and weights computation. They include an enhancement for standard iteration method for Jacobi ...
The Sine‐Gordon (SG) equations are very important in that they can accurately model many essential physical phenomena. In this paper, the Jacobi‐Gauss‐Lobatto collocation (JGL‐C) and Generalized ...
The Gauss quadrature can be formulated as a method for approximation of positive definite linear functionals. The underlying theory connects several classical topics including orthogonal polynomials ...
ABSTRACT: In this paper, Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken ...
SIAM Journal on Numerical Analysis, Vol. 51, No. 3 (2013), pp. 1443-1469 (27 pages) This paper provides a rigorous and delicate analysis for exponential decay of Jacobi polynomial expansions of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback