Electromagnetic induction (EMI) techniques are widely used in geophysical surveying. Their success is mainly due to their easy and fast data acquisition, but the effectiveness of data inversion is strongly influenced by the quality of sensed data, resulting from suiting the device configuration to the physical features of the survey site. Forward modelling is an essential tool to optimize this aspect and design a successful surveying campaign. In this paper, a new software tool for forward EMI modelling is introduced. It extends and complements an existing open-source package for EMI data inversion, and includes an interactive graphical user interface. Its use is explained by a theoretical introduction and demonstrated through a simulated case study. The nonlinear data inversion issue is briefly discussed and the inversion module of the package is extended by a new regularized minimal-norm algorithm.
25 October 2023 in The Journal of Physical Chemistry Letters
This Letter introduces the so-called Quasi Time-Reversible scheme based on Grassmann extrapolation (QTR G-Ext) of density matrices for an accurate calculation of initial guesses in Born-Oppenheimer Molecular Dynamics (BOMD) simulations. The method shows excellent results on four large molecular systems that are representative of real-life production applications, ranging from 21 to 94 atoms simulated with Kohn-Sham (KS) density functional theory surrounded with a classical environment with 6k to 16k atoms. Namely, it clearly reduces the number of self-consistent field iterations while at the same time achieving energy-conserving simulations, resulting in a considerable speed-up of BOMD simulations even when tight convergence of the KS equations is required.
We present an algorithm to solve the linear response equations for Hartree-Fock, Density Functional Theory, and the Multiconfigurational Self-Consistent Field method that is both simple and efficient. The algorithm makes use of the well-established symmetric and antisymmetric combinations of trial vectors but further orthogonalizes them with respect to the scalar product induced by the response matrix. This leads to a standard, symmetric block eigenvalue problem in the expansion subspace that can be solved by diagonalizing a symmetric, positive definite matrix half the size of the expansion space. Numerical tests showed that the algorithm is robust and stable.
The standard photometric stereo model makes several assumptions that are rarely verified in experimental datasets. In particular, the observed object should behave as a Lambertian reflector, and the light sources should be positioned at an infinite distance from it, along a known direction. Even when Lambert’s law is approximately fulfilled, an accurate assessment of the relative position between the light source and the target is often unavailable in real situations. The Hayakawa procedure is a computational method for estimating such information directly from data images. It occasionally breaks down when some of the available images excessively deviate from ideality. This is generally due to observing a non-Lambertian surface, or illuminating it from a close distance, or both. Indeed, in narrow shooting scenarios, typical, e.g., of archaeological excavation sites, it is impossible to position a flashlight at a sufficient distance from the observed surface. It is then necessary to understand if a given dataset is reliable and which images should be selected to better reconstruct the target. In this paper, we propose some algorithms to perform this task and explore their effectiveness.
The solution of nonlinear inverse problems is a challenging task in numerical analysis. In most cases, this kind of problems is solved by iterative procedures that, at each iteration, linearize the problem in a neighborhood of the currently available approximation of the solution. The linearized problem is then solved by a direct or iterative method. Among this class of solution methods, the Gauss–Newton method is one of the most popular ones. We propose an efficient implementation of this method for large-scale problems. Our implementation is based on projecting the nonlinear problem into a sequence of nested subspaces, referred to as Generalized Krylov Subspaces, whose dimension increases with the number of iterations, except for when restarts are carried out. When the computation of the Jacobian matrix is expensive, we combine our iterative method with secant (Broyden) updates to further reduce the computational cost. We show convergence of the proposed solution methods and provide a few numerical examples that illustrate their performance.