5 results
Search Results
2. A MULTIGRID METHOD FOR VARIABLE COEFFICIENT MAXWELL'S EQUATIONS.
- Author
-
Jones, J. and Lee, B.
- Subjects
- *
MAXWELL equations , *PARTIAL differential equations , *MULTIGRID methods (Numerical analysis) , *ALGEBRA , *ALGORITHMS , *NUMERICAL analysis - Abstract
This paper presents a multigrid method for solving variable coefficient Maxwell's equations. The novelty in this method is the use of interpolation operators that do not produce multilevel commutativity complexes that lead to multilevel exactness. Rather, the effects of multilevel exactness are built into the level equations themselves—on the finest level using a discrete T – V formulation and on the coarser grids through the Galerkin coarsening procedure of a T – V formulation. These built-in structures permit the levelwise use of an effective hybrid smoother on the curl-free near-nullspace components and permit the development of interpolation operators for handling the curl-free and divergence-free error components separately. The resulting block-diagonal interpolation operator does not satisfy multilevel commutativity but has good approximation properties for both of these error components. Applying operator-dependent interpolation for each of these error components leads to an effective multigrid scheme for variable coefficient Maxwell's equations, where multilevel commutativity-based methods can degrade. Numerical results are presented to verify the effectiveness of this new scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
3. TOWARD AN h-INDEPENDENT ALGEBRAIC MULTIGRID METHOD FOR MAXWELL'S EQUATIONS.
- Author
-
Hu, Jonathan J., Tuminaro, Raymond S., Bochev, Pavel B., Garasi, Christopher J., and Robinson, Allen C.
- Subjects
- *
MAXWELL equations , *PARTIAL differential equations , *ALGEBRA , *APPROXIMATION theory , *ALGORITHMS , *NUMERICAL analysis - Abstract
We propose a new algebraic multigrid (AMG) method for solving the eddy current approximations to Maxwell's equations. This AMG method has its roots in an algorithm proposed by Reitzinger and Schöberl. The main focus in the Reitzinger and Schöberl method is to maintain null-space properties of the weak ∇ × ∇ × operator on coarse grids. While these null-space properties are critical, they are not enough to guarantee h-independent convergence rates of the overall multigrid scheme. We present a new strategy for choosing intergrid transfers that not only maintains the important null-space properties on coarse grids but also yields significantly improved multigrid convergence rates. This improvement is related to those we explored in a previous paper, but is fundamentally simpler, easier to compute, and performs better with respect to both multigrid operator complexity and convergence rates. The new strategy builds on ideas in smoothed aggregation to improve the approximation property of an existing interpolation operator. By carefully choosing the smoothing operators, we show how it is sometimes possible to achieve h-independent convergence rates with a modest increase in multigrid operator complexity. Though this ideal case is not always possible, the overall algorithm performs significantly better than the original scheme in both iterations and run time. Finally, the Reitzinger and Schöberl method, as well as our previous smoothed method, are shown to be special cases of this new algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
4. COMPUTING PERIODIC ORBITS AND THEIR BIFURCATIONS WITH AUTOMATIC DIFFERENTIATION.
- Author
-
Guckenheimer, John and Meloon, Brian
- Subjects
- *
ALGORITHMS , *INTEGRATED software , *BOUNDARY element methods , *NUMERICAL analysis , *ALGEBRA , *FOUNDATIONS of arithmetic , *MATHEMATICAL analysis - Abstract
This paper formulates several algorithms for the direct computation of periodic orbits as solutions of boundary value problems. The algorithms emphasize the use of coarse meshes and high orders of accuracy. Convergence theorems are given in the limit of increasing order with a fixed mesh. The algorithms are implemented with the use of MATLAB and ADOL-C, a software package for automatic differentiation. Automatic differentiation enables accurate computation of high-order derivatives of functions without the truncation errors inherent in finite difference calculations. We embed the algorithms in a continuation framework and extend them to compute saddle-node bifur- cations of periodic orbits directly. We present data from numerical studies of four test problems, making some comparisons with other methods for computing periodic orbits. These results demonstrate that high-order methods based upon automatic differentiation are capable of high precision with small meshes. [ABSTRACT FROM AUTHOR]
- Published
- 2000
- Full Text
- View/download PDF
5. LOW-RANK MATRIX APPROXIMATION USING THE LANCZOS BIDIAGONALIZATION PROCESS WITH APPLICATIONS.
- Author
-
Simon, Horst D. and Hongyuan Zha
- Subjects
- *
SPARSE matrices , *ALGORITHMS , *NUMERICAL analysis , *MATHEMATICS , *ALGEBRA - Abstract
Low-rank approximation of large and/or sparse matrices is important in many applications, and the singular value decomposition (SVD) gives the best low-rank approximations with respect to unitarily-invariant norms. In this paper we show that good low-rank approximations can be directly obtained from the Lanczos bidiagonalization process applied to the given matrix without computing any SVD. We also demonstrate that a so-called one-sided reorthogonalization process can be used to maintain an adequate level of orthogonality among the Lanczos vectors and produce accurate low-rank approximations. This technique reduces the computational cost of the Lanczos bidiagonalization process. We illustrate the efficiency and applicability of our algorithm using numerical examples from several applications areas. [ABSTRACT FROM AUTHOR]
- Published
- 2000
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.