Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1970-1974  (2)
Material
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    BIT 14 (1974), S. 279-287 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The numerical solution of systems of differential equations of the formB dx/dt=σ(t)Ax(t)+f(t),x(0) given, whereB andA (withB and —(A+A T) positive definite) are supposed to be large sparse matrices, is considered.A-stable methods like the Implicit Runge-Kutta methods based on Radau quadrature are combined with iterative methods for the solution of the algebraic systems of equations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    BIT 12 (1972), S. 443-467 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract To solve large sparse systems of linear equations with symmetric positive definite matrixA=D+L+L*,D=diag(A), with iteration, the SSOR method with one relaxation parameter ω has been applied, yielding a spectral condition number approximately equal to the square root of that ofA, if the condition $$S(\tilde L\tilde L*) \leqq \tfrac{1}{4}$$ , where $$\tilde L = D^{ - \tfrac{1}{2}} LD^{ - \tfrac{1}{2}} $$ , is satisfied and if 0〈ω〈2 is chosen optimally. The matrix arising from the differenced Dirichlet problem satisfies in general the spectral radius condition given above, only if the coefficients of the differential equation are constant and if the mesh-width is uniform. However, using one relaxation parameter for each mesh-point, the main result for the SSOR method, that the spectral condition number varies with a parameterζ 〉 0 likeO([ζ −1 +ζ/λ 1]h −1),h → 0, whereλ 1 h 2 is the smallest eigenvalue ofD −1 A, carries over for variable smooth coefficients and even for certain kinds of discontinuities among the coefficients, if the mesh-width is adjusted properly in accordance with the discontinuity. Since the resulting matrix of iteration has positive eigenvalues, a semi-iterative technique can be used. The necessary number of iterations is thus onlyO(h −1/2).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...