19 resultados para Linear equations
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
In this paper we propose a refinement of some successive overrelaxation methods based on the reverse Gauss–Seidel method for solving a system of linear equations Ax = b by the decomposition A = Tm − Em − Fm, where Tm is a banded matrix of bandwidth 2m + 1. We study the convergence of the methods and give software implementation of algorithms in Mathematica package with numerical examples. ACM Computing Classification System (1998): G.1.3.
Resumo:
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006
Resumo:
We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.
Resumo:
2010 Mathematics Subject Classification: 35R60, 60H15, 74H35.
Resumo:
Sufficient conditions for the existence of Lp(k)-solutions of linear nonhomogeneous impulsive differential equations with unbounded linear operator are found. An example of the theory of the linear nonhomogeneous partial impulsive differential equations of parabolic type is given.
Resumo:
A modification of the Nekrassov method for finding a solution of a linear system of algebraic equations is given and a numerical example is shown.
Resumo:
2002 Mathematics Subject Classification: 35J15, 35J25, 35B05, 35B50
Resumo:
2000 Mathematics Subject Classification: 35J70, 35P15.
Resumo:
2000 Mathematics Subject Classification: 45F15, 45G10, 46B38.
Resumo:
2000 Mathematics Subject Classification: 39A10.
Resumo:
In this paper are examined some classes of linear and non-linear analytical systems of partial differential equations. Compatibility conditions are found and if they are satisfied, the solutions are given as functional series in a neighborhood of a given point (x = 0).
Resumo:
We consider a finite state automata based method of solving a system of linear Diophantine equations with coefficients from the set {-1,0,1} and solutions in {0,1}.
Resumo:
Mathematics Subject Classification: 26A33, 47A60, 30C15.
Resumo:
Mathematics Subject Classification: 26A33, 31B10
Resumo:
MSC 2010: 26A33, 44A45, 44A40, 65J10