Results 61 to 70 of about 5,971,680 (301)
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
Well-posed Inverse Eigenvalue Problems [PDF]
Summary Inverse eigenvalue problems associated with self-adjoint differential equations of order two or higher are considered. The question of what kind of data are necessary and sufficient to insure the existence of a unique solution is examined. A method of solution for well-posed inverse eigenvalue problems is then presented.
openaire +2 more sources
We report a novel interpretation method for deep learning models based on feature extraction and clustering. Applying this method to an atomistic line graph neural network (ALIGNN) model trained on optical absorption spectra of 2,681 inorganic compounds obtained from first‐principles calculations, we successfully identify key factors underlying ...
Akira Takahashi +3 more
wiley +1 more source
Quantum‐Mechanical Wave Functions in Singular Potentials: Linear and Nonlinear States
The attractive singular potential −1/r2$-1/r^2$ gives rise to the quantum collapse in the 3D linear Schroedinger equation. The article summarizes theoretical results demonstrating suppression of the collapse and creation of the missing ground state (GS) in a gas of bosonic particles, carrying an electric dipole moment, which are pulled to the central ...
Hidetsugu Sakaguchi, Boris A. Malomed
wiley +1 more source
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source
A Note on the Symmetric Recursive Inverse Eigenvalue Problem [PDF]
In a recent paper by Arav et al, SIAM J. Matrix Anal. and Appl., 22:392--412, 2000 the recursive inverse eigenvalue problem for matrices was introduced. In this paper we examine an open problem on the existence of symmetric positive semidefinite solutions that was posed there.
Raphael Loewy, Volker Mehrmann
openaire +2 more sources
Solutions to an inverse monic quadratic eigenvalue problem [PDF]
Given n+1 pairs of complex numbers and vectors (closed under complex conjugation), the inverse quadratic eigenvalue problem is to construct real symmetric or anti-symmetric matrix C and real symmetric matrix K of size n×n so that the quadratic pencil Q(λ)
Dai, Hua +3 more
core +1 more source
Abstract The linear‐quadratic regulator (LQR) problem of optimal control of an uncertain discrete‐time linear system (DTLS) is revisited in this paper from the perspective of Tikhonov regularization. We show that an optimally chosen regularization parameter reduces, compared to the classical LQR, the values of a scalar error function, as well as the ...
Fernando Pazos, Amit Bhaya
wiley +1 more source
In this paper the author describes two general methods to solve various inverse eigenvalue problems (i.e.p.). The first method is to state an i.e.p. as a system of polynomial equations. By rediscovering the non-linear alternative due to \textit{E. Noether} and \textit{B. L. van der Waerden} [Nachrichten der Gesellschaft der Wissenschaften zu Göttingen,
openaire +2 more sources
On a class of inverse quadratic eigenvalue problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yongxin Yuan, Hua Dai
openaire +2 more sources

