Related papers: Using cylindrical algebraic decomposition and loca…
Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier…
Local Fourier analysis (LFA) is a useful tool in predicting the convergence factors of geometric multigrid methods (GMG). As is well known, on rectangular domains with periodic boundary conditions this analysis gives the exact convergence…
Local Fourier analysis is a commonly used tool for the analysis of multigrid and other multilevel algorithms, providing both insight into observed convergence rates and predictive analysis of the performance of many algorithms. In this…
Local Fourier analysis is a commonly used tool to assess the quality and aid in the construction of geometric multigrid methods for translationally invariant operators. In this paper we automate the process of local Fourier analysis and…
We focus on the study of multigrid methods with aggressive coarsening and polynomial smoothers for the solution of the linear systems corresponding to finite difference/element discretizations of the Laplace equation. Using local Fourier…
We study relationships between different formulations of the local principle. Also we establish a connection among the local principle and the non-commutative Fourier transform approach to the investigation of convolution operator algebras.…
We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…
A general local Fourier analysis for overlapping block smoothers on triangular grids is presented. This analysis is explained in a general form for its application to problems with different discretizations. This tool is demonstrated for…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields. However, it has a worst case complexity doubly exponential in…
In this paper a local Fourier analysis for multigrid methods on tetrahedral grids is presented. Different smoothers for the discretization of the Laplace operator by linear finite elements on such grids are analyzed. A four-color smoother…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
This paper proposes a novel localized Fourier extension method for approximating non-periodic functions via domain segmentation. By partitioning the computational domain into subregions with uniform discretization scales, the method…
In this work, a local Fourier analysis is presented to study the convergence of multigrid methods based on additive Schwarz smoothers. This analysis is presented as a general framework which allows us to study these smoothers for any type…
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an…
Designing experiments for generalized linear models is difficult because optimal designs depend on unknown parameters. The local optimality approach is to study the regions in parameter space where a given design is optimal. In many…
We present a local Fourier slice equation that enables local and sparse projection of a signal. Our result exploits that a slice in frequency space is an iso-parameter set in spherical coordinates. Therefore, the projection of suitable…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…
A set of semi-analytical techniques based on Fourier analysis is used to solve wave scattering problems in variously shaped waveguides with varying normal admittance boundary conditions. Key components are newly developed conformal mapping…