APPROXIMATE PARTIAL NOETHER OPERATORS OF THE SCHWARZSCHILD SPACETIME

The objective of this paper is twofold: (a) to find a natural example of a perturbed Lagrangian that has different partial Noether operators with symmetries different from those of the underlying Lagrangian. First we regard the Schwarzschild spacetime as a perturbation of the Minkowski spacetime and investigate the approximate partial Noether operators for this perturbed spacetime. It is shown that the Minkowski spacetime has 12 partial Noether operators, 10 of which are different from the 17 Noether symmetries for this spacetime. It is found that for the perturbed Schwarzschild spacetime we recover the exact partial Noether operators as trivial first-order approximate partial Noether operators and there is no non-trivial approximate partial Noether operator as for the Noether case. As a consequence we state a conjecture. (b) Then we prove a conjecture that the approximate symmetries of a perturbed Lagrangian form a subalgebra of the approximate symmetries of the corresponding perturbed Euler–Lagrange equations and illustrate it by our examples. This is in contrast to approximate partial Noether operators.     

Behind the success of modified coupled-cluster methods: addition by subtraction

ABSTRACT

Modified coupled-cluster (CC) methods such as linearized coupled-cluster doubles (LinCCD), approximate coupled pair (ACP D14), 2CC (from nCC family), parameterized CCSD (pCCSD) and distinguishable cluster (DCSD) can have their advantages over general CC methods. Though these methods include connected clusters of single and double excitations at most, distinguishable cluster, parameterized CC and approximate coupled pair methods, in particular, have been shown to produce quantitatively correct results in benchmark studies. To put these methods on a stronger foothold, it is essential to understand the rationale for their success: mimicking the effect of connected triple excitations. We exploit the relation between CC and many body perturbation theory (MBPT) in general, and between CCSD and MBPT(4)/MP4 in particular, to take a step towards bringing clarity to this persisting conundrum. Our aim here is to look for numerical signs of ‘addition by subtraction’ or ‘inclusion by deletion’ effect that is likely behind the success of these modified CCD or CCSD methods. We achieve this by revisiting well-studied examples of single and multiple bond dissociation and comparing the performance of these modified CCSD methods with higher-level CC methods. Though our results are qualitative in nature, we hope this would lead to more rigorous analysis in future studies.     

A fourth-order approximate projection method for the incompressible Navier–Stokes equations on locally-refined periodic domains

In this follow-up of our previous work [30], the author proposes a high-order semi-implicit method for numerically solving the incompressible Navier–Stokes equations on locally-refined periodic domains. Fourth-order finite-volume stencils are employed for spatially discretizing various operators in the context of structured adaptive mesh refinement (AMR). Time integration adopts a fourth-order, semi-implicit, additive Runge–Kutta method to treat the non-stiff convection term explicitly and the stiff diffusion term implicitly. The divergence-free condition is fulfilled by an approximate projection operator. Altogether, these components yield a simple algorithm for simulating incompressible viscous flows on periodic domains with fourth-order accuracies both in time and in space. Results of numerical tests show that the proposed method is superior to previous second-order methods in terms of accuracy and efficiency. A major contribution of this work is the analysis of a fourth-order approximate projection operator.     

Approximate time-optimal control of quantum ensembles based on sampling and learning

For a general quantum ensemble with Hamiltonian fluctuations, this paper proposes a sampling-based two-stage approximate time-optimal control algorithm with momentum terms and achieves a high-fidelity state transition of all member systems to a common target state within an approximate minimum time. The fidelity and the control time are respectively optimized in the two stages. In particular, the introduction of momentum terms greatly improves the convergence rate of the algorithm. Simulation experiments on a two-level quantum ensemble verify the effectiveness of the proposed algorithm.     

Fast pattern-matching on indeterminate strings

In a string x on an alphabet Σ, a position i is said to be indeterminate iff x[i] may be any one of a specified subset {λ₁,λ₂,…,λ_j} of Σ, 2j|Σ|. A string x containing indeterminate positions is therefore also said to be indeterminate. Indeterminate strings can arise in DNA and amino acid sequences as well as in cryptological applications and the analysis of musical texts. In this paper we describe fast algorithms for finding all occurrences of a pattern p=p[1..m] in a given text x=x[1..n], where either or both of p and x can be indeterminate. Our algorithms are based on the Sunday variant of the Boyer–Moore pattern-matching algorithm, one of the fastest exact pattern-matching algorithms known. The methodology we describe applies more generally to all variants of Boyer–Moore (such as Horspool's, for example) that depend only on calculation of the δ (“rightmost shift”) array: our method therefore assumes that Σ is indexed (essentially, an integer alphabet), a requirement normally satisfied in practice.     

The H2+ molecular ion: Low-lying states

Matching for a wavefunction the WKB expansion at large distances and Taylor expansion at small distances leads to a compact, few-parametric uniform approximation found in Turbiner and Olivares-Pilon (2011). The ten low-lying eigenstates of H₂⁺ of the quantum numbers (n,m,Λ,±)$(n,m,\Lambda ,\pm )$  with n=m=0$n=m=0$ at Λ=0,1,2$\Lambda =0,1,2$, with n=1$n=1$, m=0$m=0$ and n=0$n=0$, m=1$m=1$ at Λ=0$\Lambda =0$ of both parities are explored for all interproton distances R$R$. For all these states this approximation provides the relative accuracy ?10⁻⁵$?10^{-5}$ (not less than 5 s.d.) locally, for any real coordinate x$x$ in eigenfunctions, when for total energy E(R)$E\left(R\right)$ it gives 10-11 s.d. for R∈[0,50]$R\in [0,50]$  a.u. Corrections to the approximation are evaluated in the specially-designed, convergent perturbation theory. Separation constants are found with not less than 8 s.d. The oscillator strength for the electric dipole transitions E1$E1$ is calculated with not less than 6 s.d. A dramatic dip in the E1$E1$ oscillator strength f_{1sσg−3pσu}$f_{1s{\sigma }_g-3p{\sigma }_u}$ at R∼R_eq$R\sim R_{eq}$ is observed. The magnetic dipole and electric quadrupole transitions are calculated for the first time with not less than 6 s.d. in oscillator strength. For two lowest states (0,0,0,±)$(0,0,0,\pm )$ (or, equivalently, 1sσ_g$1s{\sigma }_g$ and 2pσ_u$2p{\sigma }_u$ states) the potential curves are checked and confirmed in the Lagrange mesh method within 12 s.d. Based on them the Energy Gap between 1sσ_g$1s{\sigma }_g$ and 2pσ_u$2p{\sigma }_u$ potential curves is approximated with modified Pade Re^−R[Pade(8/7)](R)$R{e}^{-R}\left[Pade(8/7)\right]\left(R\right)$ with not less than 4-5 figures at R∈[0,40]$R\in [0,40]$ a.u. Sum of potential curves E_1sσg+E_2pσu$E_{1s{\sigma }_g}+E_{2p{\sigma }_u}$ is approximated by Pade 1/R[Pade(5/8)](R)$1/R\left[Pade(5/8)\right]\left(R\right)$ in R∈[0,40]$R\in [0,40]$ a.u. with not less than 3-4 figures.     

Approximate Controllability of Neutral Functional Differential Systems with State-Dependent Delay

This paper deals with the approximate controllability of semilinear neutral functional differential systems with state-dependent delay. The fractional power theory and α-norm are used to discuss the problem so that the obtained results can apply to the systems involving derivatives of spatial variables. By methods of functional analysis and semigroup theory, sufficient conditions of approximate controllability are formulated and proved. Finally, an example is provided to illustrate the applications of the obtained results.     

Support-type properties of convex functions of higher order and Hadamard-type inequalities

It is well known that every convex function (where I⊂R is an interval) admits an affine support at every interior point of I (i.e. for any x₀∈IntI there exists an affine function such that a(x₀)=f(x₀) and a?f on I). Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree no greater than the order of convexity. In this paper the attaching method is developed. It is applied to obtain the general result—Theorem 2, from which the mentioned above support theorem and some related properties of convex functions of higher (both odd and even) order are derived. They are applied to obtain some known and new Hadamard-type inequalities between the quadrature operators and the integral approximated by them. It is also shown that the error bounds of quadrature rules follow by inequalities of this kind.     

多元周期函数的一类逼近及逼近阶估计

本文讨论了多元周期函数的一类逼近,得到一个稠密性的充要条件并构造出适当的逼近函数,给出了逼近阶的精确估计．