相关论文: Janis-Newman algorithm: simplifications and gauge …
A generalization of the Newton-based matrix splitting iteration method (GNMS) for solving the generalized absolute value equations (GAVEs) is proposed. Under mild conditions, the GNMS method converges to the unique solution of the GAVEs.…
A general action is proposed for the fields of $q$-dimensional differential form over the compact Riemannian manifold of arbitrary dimensions. Mathematical tools are based on the well-known de Rham-Kodaira decomposing theorem on harmonic…
This work presents a novel version of recently developed Gauss-Newton method for solving systems of nonlinear equations, based on upper bound of solution residual and quadratic regularization ideas. We obtained for such method global…
A consistent, local coordinate formulation of covariant Hamiltonian field theory is presented. While the covariant canonical field equations are equivalent to the Euler-Lagrange field equations, the covariant canonical transformation theory…
Gauge-invariant Wigner theory describes the quantum-mechanical evolution of charged particles in the presence of an electromagnetic field in phase space, which is spanned by position and kinetic momentum. This approach is independent of the…
The Koopman-von Neumann equation describes the evolution of wavefunctions associated with autonomous ordinary differential equations and can be regarded as a quantum physics-inspired formulation of classical mechanics. The main advantage…
In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…
We shall investigate randomized algorithms for solving large-scale linear inverse problems with general regularizations. We first present some techniques to transform inverse problems of general form into the ones of standard form, then…
This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…
Diagrammatic techniques are invented to implement QCD gauge transformations. These techniques can be used to discover how gauge-dependent terms are cancelled among diagrams to yield gauge-invariant results in the sum. In this way a…
Recent developments in optimization theory have extended some traditional algorithms for least-squares optimization of real-valued functions (Gauss-Newton, Levenberg-Marquardt, etc.) into the domain of complex functions of a complex…
We show that at 1PN all four-dimensional black hole solutions in asymptotically flat spacetimes can be derived from leading singularities involving minimally coupled three-particle amplitudes. Furthermore, we show that the rotating…
Dirac algorithm allows to construct Hamiltonian systems for singular systems, and so contributing to its successful quantization. A drawback of this method is that the resulting quantized theory does not have manifest Lorentz invariance.…
This article presents a compact implementation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. Each iteration of the algorithm consists of applying a pair of complementary Gauss-Jordan…
We present a new proof of Cramer's rule by interpreting a system of linear equations as a transformation of $n$-dimensional Cartesian-coordinate vectors. To find the solution, we carry out the inverse transformation by convolving the…
The explicit formula for the elements of the successive intermediate matrices of the Gauss-Jordan elimination procedure for the solution of systems of linear equations is applied to error analysis. Stability conditions in terms of relative…
This Proceeding presents the method that allows us to get the Gyro-Kinetic Approximation of the Dynamical System satisfied by the trajectory of a particle submitted to a Strong Magnetic Field. The goal of the method is to build a change of…
Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…
The problem of merging in black holes the rotation and a massless scalar field is treated. It is argued in the comment that the Kerr-like and Demianski-like metrics in General Relativity with a free massless scalar field or in the free…
One of the great triumphs in the history of numerical methods was the discovery of the Conjugate Gradient (CG) algorithm. It could solve a symmetric positive-definite system of linear equations of dimension N in exactly N steps. As many…