skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS%2503.

Abstract

Abstract not provided.

Authors:
; ;
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1143315
Report Number(s):
SAND2007-0875J
523940
DOE Contract Number:
DE-AC04-94AL85000
Resource Type:
Journal Article
Resource Relation:
Journal Name: SIAM J. of Numerical Analysis.; Related Information: Proposed for publication in SIAM J. of Numerical Analysis..
Country of Publication:
United States
Language:
English

Citation Formats

Boman, Erik G., Hendrickson, Bruce A., and Vavasis, Stephen. SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS%2503.. United States: N. p., 2007. Web.
Boman, Erik G., Hendrickson, Bruce A., & Vavasis, Stephen. SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS%2503.. United States.
Boman, Erik G., Hendrickson, Bruce A., and Vavasis, Stephen. Thu . "SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS%2503.". United States. doi:.
@article{osti_1143315,
title = {SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS%2503.},
author = {Boman, Erik G. and Hendrickson, Bruce A. and Vavasis, Stephen},
abstractNote = {Abstract not provided.},
doi = {},
journal = {SIAM J. of Numerical Analysis.},
number = ,
volume = ,
place = {United States},
year = {Thu Feb 01 00:00:00 EST 2007},
month = {Thu Feb 01 00:00:00 EST 2007}
}
  • We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for defining matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and in particular it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoreticmore » techniques can also solve a class of finite element problems in nearly linear time. We show that the quality of our approximation, which controls the number of iterations in the preconditioned iterative solver, depends primarily on a mesh quality measure but not on the problem size or shape of the domain.« less
  • We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for defining matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and in particular it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoretic techniques can alsomore » solve a class of finite element problems in nearly linear time. We show that the support number bounds, which control the number of iterations in the preconditioned iterative solver, depend on mesh quality measures but not on the problem size or shape of the domain.« less
  • The temporal subdomain method (TSM), based on a spatial finite element formulation, is investigated as a method for the solution of the space-time-dependent multigroup neutron dynamics equations. The spatial aspect of the problem was formulated as an array of finite elements by using a two-dimensional rectangular coordinate system subdivided into contiguous triangular elements. Within each element and within each neutron group, the flux was represented by a linear polynomial. Numerical experiments using a computer program developed during the course of the investigation demonstrated that the method is straightforward to implement and that it produces stable calculations for a wide rangemore » of time steps. The stability of the method has been tested for sinusoidal, ramp, and step-changed reactivity insertions. The results show that the TSM outperforms most alternating direction implicit methods in the sense that a similar degree of accuracy can be achieved with larger time steps using the same number of nodes. System condition number calculations as a function of node number were also carried out for a series of static eigenvalue calculations to determine the likelihood of error propagation and the difficulty of inverting the global system matrices during the time-dependent calculations.« less
  • We present a mixed vector finite element method for solving the time dependent coupled Ampere and Faraday laws of Maxwell's equations on unstructured hexahedral grids that employs high order discretization in both space and time. The method is of arbitrary order accuracy in space and up to 5th order accurate in time, making it well suited for electrically large problems where grid anisotropy and numerical dispersion have plagued other methods. In addition, the method correctly models both the jump discontinuities and the divergence-free properties of the electric and magnetic fields, is charge and energy conserving, conditionally stable, and free ofmore » spurious modes. Several computational experiments are performed to demonstrate the accuracy, efficiency and benefits of the method.« less
  • A new preconditioned dual–primal nonoverlapping domain decomposition method is proposed for the finite element solution of three-dimensional large-scale electromagnetic problems. With the aid of two Lagrange multipliers, the new method converts the original volumetric problem to a surface problem by using a higher-order transmission condition at the subdomain interfaces to significantly improve the convergence of the iterative solution of the global interface equation. Similar to the previous version, a global coarse problem related to the degrees of freedom at the subdomain corner edges is formulated to propagate the residual error to the whole computational domain at each iteration, which furthermore » increases the rate of convergence. In addition, a fully algebraic preconditioner based on matrix splitting is constructed to make the proposed domain decomposition method even more robust and scalable. Perfectly matched layers (PMLs) are considered for the boundary truncation when solving open-region problems. The influence of the PML truncation on the convergence performance is investigated by examining the convergence of the transmission condition for an interface inside the PML. Numerical examples including wave propagation and antenna radiation problems truncated with PMLs are presented to demonstrate the validity and the capability of this method.« less