Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn efficient method for computing the eigenfunctions of the dynamo equation
116
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present an elegant method of determining the eigensolutions of the induction and the dynamo equation in a fluid embedded in a vacuum. The magnetic field is expanded in a complete set of functions. The new method is based on the biorthogonality of the adjoint electric current and the vector potential with an inner product defined by a volume integral over the fluid domain. The advantage of this method is that the velocity and the dynamo coefficients of the induction and the dynamo equation do not have to be differentiated and thus even numerically determined tabulated values of the coefficients produce reasonable results. We provide test calculations and compare with published results obtained by the classical treatment based on the biorthogonality of the magnetic field and its adjoint. We especially consider dynamos with mean-field coefficients determined from direct numerical simulations of the geodynamo and compare with initial value calculations and the full MHD simulations.
rate research
Read More
Starting from the adiabatic time-dependent Hartree-Fock approximation (ATDHF), we propose an efficient method to calculate the Thouless-Valatin moments of inertia for the nuclear system. The method is based on the rapid convergence of the expansion of the inertia matrix. The accuracy of the proposed method is verified in the rotational case by comparing the results with the exact Thouless-Valatin moments of inertia calculated using the self-consistent cranking model. The proposed method is computationally much more efficient than the full ATDHF calculation, yet it retains a high accuracy of the order of 1%.
We propose an efficient and flexible method for solving Abel integral equation of the first kind, frequently appearing in many fields of astrophysics, physics, chemistry, and applied sciences. This equation represents an ill-posed problem, thus solving it requires some kind of regularization. Our method is based on solving the equation on a so-called compact set of functions and/or using Tikhonovs regularization. A priori constraints on the unknown function, defining a compact set, are very loose and can be set using simple physical considerations. Tikhonovs regularization on itself does not require any explicit a priori constraints on the unknown function and can be used independently of such constraints or in combination with them. Various target degrees of smoothness of the unknown function may be set, as required by the problem at hand. The advantage of the method, apart from its flexibility, is that it gives uniform convergence of the approximate solution to the exact solution, as the errors of input data tend to zero. The method is illustrated on several simulated models with known solutions. An example of astrophysical application of the method is also given.
This article studies a direct numerical approach for fractional advection-diffusion equations (ADEs). Using a set of cubic trigonometric B-splines as test functions, a differential quadrature (DQ) method is firstly proposed for the 1D and 2D time-fractional ADEs of order $(0,1]$. The weighted coefficients are determined, and with them, the original equation is transformed into a group of general ordinary differential equations (ODEs), which are discretized by an effective difference scheme or Runge-Kutta method. The stability is investigated under a mild theoretical condition. Secondly, based on a set of cubic B-splines, we develop a new Crank-Nicolson type DQ method for the 2D space-fractional ADEs without advection. The DQ approximations to fractional derivatives are introduced and the values of the fractional derivatives of B-splines are computed by deriving explicit formulas. The presented DQ methods are evaluated on five benchmark problems and the concrete simulations of the unsteady propagation of solitons and Gaussian pulse. In comparison with the existing algorithms in the open literature, numerical results finally illustrate the validity and accuracy.
In a recent MNRAS article, Raposo-Pulido and Pelaez (RPP) designed a scheme for obtaining very close seeds for solving the elliptic Kepler Equation with the classical and the modified Newton-Rapshon methods. This implied an important reduction in the number of iterations needed to reach a given accuracy. However, RPP also made strong claims about the errors of their method that are incorrect. In particular, they claim that their accuracy can always reach the level $sim5varepsilon$, where $varepsilon$ is the machine epsilon (e.g. $varepsilon=2.2times10^{-16} $ in double precision), and that this result is attained for all values of the eccentricity $e<1$ and the mean anomaly $Min[0,pi]$, including for $e$ and $M$ that are arbitrarily close to $1$ and $0$, respectively. However, we demonstrate both numerically and analytically that any implementation of the classical or modified Newton-Raphson methods for Keplers equation, including those described by RPP, have a limiting accuracy of the order $simvarepsilon/sqrt{2(1-e)}$. Therefore the errors of these implementations diverge in the limit $eto1$, and differ dramatically from the incorrect results given by RPP. Despite these shortcomings, the RPP method can provide a very efficient option for reaching such limiting accuracy. We also provide a limit that is valid for the accuracy of any algorithm for solving Kepler equation, including schemes like bisection that do not use derivatives. Moreover, similar results are also demonstrated for the hyperbolic Kepler Equation. The methods described in this work can provide guidelines for designing more accurate solutions of the elliptic and hyperbolic Kepler equations.
The spectral renormalization method was introduced in 2005 as an effective way to compute ground states of nonlinear Schrodinger and Gross-Pitaevskii type equations. In this paper, we introduce an orthogonal spectral renormalization (OSR) method to compute ground and excited states (and their respective eigenvalues) of linear and nonlinear eigenvalue problems. The implementation of the algorithm follows four simple steps: (i) reformulate the underlying eigenvalue problem as a fixed point equation, (ii) introduce a renormalization factor that controls the convergence properties of the iteration, (iii) perform a Gram-Schmidt orthogonalization process in order to prevent the iteration from converging to an unwanted mode; and (iv) compute the solution sought using a fixed-point iteration. The advantages of the OSR scheme over other known methods (such as Newtons and self-consistency) are: (i) it allows the flexibility to choose large varieties of initial guesses without diverging, (ii) easy to implement especially at higher dimensions and (iii) it can easily handle problems with complex and random potentials. The OSR method is implemented on benchmark Hermitian linear and nonlinear eigenvalue problems as well as linear and nonlinear non-Hermitian $mathcal{PT}$-symmetric models.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
