2,371 research outputs found
Spectral Methods for Numerical Relativity. The Initial Data Problem
Numerical relativity has traditionally been pursued via finite differencing.
Here we explore pseudospectral collocation (PSC) as an alternative to finite
differencing, focusing particularly on the solution of the Hamiltonian
constraint (an elliptic partial differential equation) for a black hole
spacetime with angular momentum and for a black hole spacetime superposed with
gravitational radiation. In PSC, an approximate solution, generally expressed
as a sum over a set of orthogonal basis functions (e.g., Chebyshev
polynomials), is substituted into the exact system of equations and the
residual minimized. For systems with analytic solutions the approximate
solutions converge upon the exact solution exponentially as the number of basis
functions is increased. Consequently, PSC has a high computational efficiency:
for solutions of even modest accuracy we find that PSC is substantially more
efficient, as measured by either execution time or memory required, than finite
differencing; furthermore, these savings increase rapidly with increasing
accuracy. The solution provided by PSC is an analytic function given
everywhere; consequently, no interpolation operators need to be defined to
determine the function values at intermediate points and no special
arrangements need to be made to evaluate the solution or its derivatives on the
boundaries. Since the practice of numerical relativity by finite differencing
has been, and continues to be, hampered by both high computational resource
demands and the difficulty of formulating acceptable finite difference
alternatives to the analytic boundary conditions, PSC should be further pursued
as an alternative way of formulating the computational problem of finding
numerical solutions to the field equations of general relativity.Comment: 15 pages, 5 figures, revtex, submitted to PR
Two combined methods for the global solution of implicit semilinear differential equations with the use of spectral projectors and Taylor expansions
Two combined numerical methods for solving semilinear differential-algebraic
equations (DAEs) are obtained and their convergence is proved. The comparative
analysis of these methods is carried out and conclusions about the
effectiveness of their application in various situations are made. In
comparison with other known methods, the obtained methods require weaker
restrictions for the nonlinear part of the DAE. Also, the obtained methods
enable to compute approximate solutions of the DAEs on any given time interval
and, therefore, enable to carry out the numerical analysis of global dynamics
of mathematical models described by the DAEs. The examples demonstrating the
capabilities of the developed methods are provided. To construct the methods we
use the spectral projectors, Taylor expansions and finite differences. Since
the used spectral projectors can be easily computed, to apply the methods it is
not necessary to carry out additional analytical transformations
A non-adapted sparse approximation of PDEs with stochastic inputs
We propose a method for the approximation of solutions of PDEs with
stochastic coefficients based on the direct, i.e., non-adapted, sampling of
solutions. This sampling can be done by using any legacy code for the
deterministic problem as a black box. The method converges in probability (with
probabilistic error bounds) as a consequence of sparsity and a concentration of
measure phenomenon on the empirical correlation between samples. We show that
the method is well suited for truly high-dimensional problems (with slow decay
in the spectrum)
- …