An extension of the Cayley transform method for a parameterized generalized inverse eigenvalue problem

[EN] Since recent studies have shown that the Cayley transform method can be an effective iterative method for solving the inverse eigenvalue problem, in this work, we consider using an extension of it for solving a type of parameterized generalized inverse eigenvalue problem and prove its locally quadratic convergence. This type of inverse eigenvalue problem, which includes multiplicative and additive inverse eigenvalue problems, appears in many applications. Also, we consider the case where the given eigenvalues are multiple. In this case, we describe a modified problem that is not overdetermined and discuss the extension of the Cayley transform method for this modified problem. Finally, to demonstrate the effectiveness of these algorithms, we present some numerical examples to show that the proposed methods are practical and efficient.The authors would like to express their heartfelt thanks to the editor and anonymous referees for their useful comments and constructive suggestions that substantially improved the quality and presentation of this article. This research was developed during a visit of Z.D. to Universitat Politecnica de Valencia. Z.D. would like to thank the hospitality shown by D. Sistemes Informatics i Computacio, Universitat Politecnica de Valencia. J.E.R. was partially supported by the Spanish Agencia Estatal de Investigacion (AEI) under grant TIN2016-75985-P, which includes European Commission ERDF funds. The authors thank Carmen Campos for useful comments on an initial draft of the article.Dalvand, Z.; Hajarian, M.; Román Moltó, JE. (2020). An extension of the Cayley transform method for a parameterized generalized inverse eigenvalue problem. Numerical Linear Algebra with Applications. 27(6):1-24. https://doi.org/10.1002/nla.2327S124276Chu, M., & Golub, G. (2005). Inverse Eigenvalue Problems. doi:10.1093/acprof:oso/9780198566649.001.0001Hajarian, M., & Abbas, H. (2018). Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints. Computers & Mathematics with Applications, 76(6), 1458-1475. doi:10.1016/j.camwa.2018.06.038Hajarian, M. (2019). An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems. Journal of Computational and Applied Mathematics, 346, 418-431. doi:10.1016/j.cam.2018.07.025Hajarian, M. (2018). Solving constrained quadratic inverse eigenvalue problem via conjugate direction method. Computers & Mathematics with Applications, 76(10), 2384-2401. doi:10.1016/j.camwa.2018.08.034Chu, M. T., & Golub, G. H. (2002). Structured inverse eigenvalue problems. Acta Numerica, 11, 1-71. doi:10.1017/s0962492902000016Ghanbari, K., & Parvizpour, F. (2012). Generalized inverse eigenvalue problem with mixed eigendata. Linear Algebra and its Applications, 437(8), 2056-2063. doi:10.1016/j.laa.2012.05.020Yuan, Y.-X., & Dai, H. (2009). A generalized inverse eigenvalue problem in structural dynamic model updating. Journal of Computational and Applied Mathematics, 226(1), 42-49. doi:10.1016/j.cam.2008.05.015Yuan, S.-F., Wang, Q.-W., & Xiong, Z.-P. (2013). Linear parameterized inverse eigenvalue problem of bisymmetric matrices. Linear Algebra and its Applications, 439(7), 1990-2007. doi:10.1016/j.laa.2013.05.026Dai, H., Bai, Z.-Z., & Wei, Y. (2015). On the Solvability Condition and Numerical Algorithm for the Parameterized Generalized Inverse Eigenvalue Problem. SIAM Journal on Matrix Analysis and Applications, 36(2), 707-726. doi:10.1137/140972494Gladwell, G. M. L. (1986). Inverse Problems in Vibration. Applied Mechanics Reviews, 39(7), 1013-1018. doi:10.1115/1.3149517Friedland, S., Nocedal, J., & Overton, M. L. (1987). The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems. SIAM Journal on Numerical Analysis, 24(3), 634-667. doi:10.1137/0724043Chan, R. H. (2003). BIT Numerical Mathematics, 43(1), 7-20. doi:10.1023/a:1023611931016Bai, Z.-J., Chan, R. H., & Morini, B. (2004). An inexact Cayley transform method for inverse eigenvalue problems. Inverse Problems, 20(5), 1675-1689. doi:10.1088/0266-5611/20/5/022Shen, W. P., Li, C., & Jin, X. Q. (2011). A Ulm-like method for inverse eigenvalue problems. Applied Numerical Mathematics, 61(3), 356-367. doi:10.1016/j.apnum.2010.11.001Shen, W., & Li, C. (2012). AN ULM-LIKE CAYLEY TRANSFORM METHOD FOR INVERSE EIGENVALUE PROBLEMS. Taiwanese Journal of Mathematics, 16(1). doi:10.11650/twjm/1500406546Aishima, K. (2018). A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems. Linear Algebra and its Applications, 542, 310-333. doi:10.1016/j.laa.2017.05.019Shen, W. P., Li, C., & Jin, X. Q. (2015). An inexact Cayley transform method for inverse eigenvalue problems with multiple eigenvalues. Inverse Problems, 31(8), 085007. doi:10.1088/0266-5611/31/8/085007Shen, W., Li, C., & Jin, X. (2016). An Ulm-like Cayley Transform Method for Inverse Eigenvalue Problems with Multiple Eigenvalues. Numerical Mathematics: Theory, Methods and Applications, 9(4), 664-685. doi:10.4208/nmtma.2016.y15030Aishima, K. (2018). A quadratically convergent algorithm for inverse eigenvalue problems with multiple eigenvalues. Linear Algebra and its Applications, 549, 30-52. doi:10.1016/j.laa.2018.03.022Li, L. (1995). Sufficient conditions for the solvability of an algebraic inverse eigenvalue problem. Linear Algebra and its Applications, 221, 117-129. doi:10.1016/0024-3795(93)00225-oBiegler-König, F. W. (1981). Sufficient conditions for the solubility of inverse eigenvalue problems. Linear Algebra and its Applications, 40, 89-100. doi:10.1016/0024-3795(81)90142-7Alexander, J. C. (1978). The additive inverse eigenvalue problem and topological degree. Proceedings of the American Mathematical Society, 70(1), 5-5. doi:10.1090/s0002-9939-1978-0487546-3Byrnes, C. I., & Wang, X. (1993). The Additive Inverse Eigenvalue Problem for Lie Perturbations. SIAM Journal on Matrix Analysis and Applications, 14(1), 113-117. doi:10.1137/0614009Wang, Z., & Vong, S. (2013). A Guass–Newton-like method for inverse eigenvalue problems. International Journal of Computer Mathematics, 90(7), 1435-1447. doi:10.1080/00207160.2012.750721Jiang, J., Dai, H., & Yuan, Y. (2013). A symmetric generalized inverse eigenvalue problem in structural dynamics model updating. Linear Algebra and its Applications, 439(5), 1350-1363. doi:10.1016/j.laa.2013.04.021Cox, S. J., Embree, M., & Hokanson, J. M. (2012). One Can Hear the Composition of a String: Experiments with an Inverse Eigenvalue Problem. SIAM Review, 54(1), 157-178. doi:10.1137/080731037Ji, X. (1998). On matrix inverse eigenvalue problems. Inverse Problems, 14(2), 275-285. doi:10.1088/0266-5611/14/2/004Dai, H., & Lancaster, P. (1997). Newton’s Method for a Generalized Inverse Eigenvalue Problem. Numerical Linear Algebra with Applications, 4(1), 1-21. doi:10.1002/(sici)1099-1506(199701/02)4:13.0.co;2-dShu, L., Bo, W., & Ji-zhong, H. (2004). Homotopy solution of the inverse generalized eigenvalue problems in structural dynamics. Applied Mathematics and Mechanics, 25(5), 580-586. doi:10.1007/bf02437606Dai, H. (1999). An algorithm for symmetric generalized inverse eigenvalue problems. Linear Algebra and its Applications, 296(1-3), 79-98. doi:10.1016/s0024-3795(99)00109-3Lancaster, P. (1964). Algorithms for lambda-matrices. Numerische Mathematik, 6(1), 388-394. doi:10.1007/bf01386088Biegler-K�nig, F. W. (1981). A Newton iteration process for inverse eigenvalue problems. Numerische Mathematik, 37(3), 349-354. doi:10.1007/bf01400314Parlett, B. N. (1998). The Symmetric Eigenvalue Problem. doi:10.1137/1.9781611971163Higham, N. J. (2008). Functions of Matrices. doi:10.1137/1.978089871777

Highly accurate quadrature-based Scharfetter--Gummel schemes for charge transport in degenerate semiconductors

We introduce a family of two point flux expressions for charge carrier transport described by drift-diffusion problems in degenerate semiconductors with non-Boltzmann statistics which can be used in Vorono"i finite volume discretizations. In the case of Boltzmann statistics, Scharfetter and Gummel derived such fluxes by solving a linear two point boundary value problem yielding a closed form expression for the flux. Instead, a generalization of this approach to the nonlinear case yields a flux value given implicitly as the solution of a nonlinear integral equation. We examine the solution of this integral equation numerically via quadrature rules to approximate the integral as well as Newton's method to solve the resulting approximate integral equation. This approach results into a family of quadrature-based Scharfetter-Gummel flux approximations. We focus on four quadrature rules and compare the resulting schemes with respect to execution time and accuracy. A convergence study reveals that the solution of the approximate integral equation converges exponentially in terms of the number of quadrature points. With very few integration nodes they are already more accurate than a state-of-the-art reference flux, especially in the challenging physical scenario of high nonlinear diffusion. Finally, we show that thermodynamic consistency is practically guaranteed

RESONANT ULTRASOUND SPECTROSCOPY: SENSITIVITY ANALYSIS FOR ANISOTROPIC MATERIALS WITH HEXAGONAL SYMMETRY

Resonance ultrasound spectroscopy (RUS) is an experimental method by which material properties are obtained by careful observation of the resonant vibrations of a meticulously crafted sample. Among the most common applications of this technique is the determination of single-crystal elasticity. Previous works have considered the reliability of elasticity information obtained via the RUS method when the material is of isotropic or cubic symmetry, and this work extends these efforts to materials with hexagonal symmetry, such as titanium di-boride. The reliability of elasticity information obtained by RUS is evaluated by Sobol Analysis and by close examination of the stiffness-frequency functionality. Findings show that the values of off-diagonal elements of the Voigt stiffness matrix are error-prone due to insensitivity of the resonant spectrum; regression of these elements’ values is not robust to experimental errors in measuring the resonant frequencies. Techniques based on surface acoustic wave measurements are demonstrated to be a suitable supplement to RUS for more reliable determination of the off-diagonal stiffness values, forming a complete and accurate characterization of the material elasticity

Spectral Methods For Hamiltonian Systems And Their Applications

Hamiltonian systems typically arise as models of conservative physical systems and have many applications. Our main emphasis is using spectral methods to preserve both symplectic structure and energy up to machine error in long time. An engery error estimation is given for a type of Hamiltonian systems with polynomial nonlinear part, which is numerical verified by solving a Henon-Heiles systems. Three interesting applications are presented : the first one is the N-body problems. The second one is approximation for Weyl\u27s Law and the third one is simulating quantum cooling in an optomechanical system to study the dissipative dynamics. Moreover, nonsmooth Hamiltonian systems problems are discussed for the limitation of this method which motivates our future work

On multicollinearity and concurvity in some nonlinear multivariate models

Recent developments of multivariate smoothing methods provide a rich collection of feasible models for nonparametric multivariate data analysis. Among the most interpretable are those with smoothed additive terms. Construction of various methods and algorithms for computing the models have been the main concern in literature in this area. Less results are available on the validation of computed fit, instead, and many applications of nonparametric methods end up in computing and comparing the generalized validation error or related indexes. This article reviews the behavior of some of the best known multivariate nonparametric methods, based on subset selection and on projection, when (exact) collinearity or multicollinearity (near collinearity) is present in the input matrix. It shows the possible aliasing effects in computed fits of some selection methods and explores the properties of the projection spaces reached by projection methods in order to help data analysts to select the best model in case of ill conditioned input matrices. Two simulation studies and a real data set application are presented to illustrate further the effects of collinearity or multicollinearity in the fit

Coarse-graining Kohn-Sham Density Functional Theory

We present a real-space formulation for coarse-graining Kohn-Sham Density Functional Theory that significantly speeds up the analysis of material defects without appreciable loss of accuracy. The approximation scheme consists of two steps. First, we develop a linear-scaling method that enables the direct evaluation of the electron density without the need to evaluate individual orbitals. We achieve this by performing Gauss quadrature over the spectrum of the linearized Hamiltonian operator appearing in each iteration of the self-consistent field method. Building on the linear-scaling method, we introduce a spatial approximation scheme resulting in a coarse-grained Density Functional Theory. The spatial approximation is adapted so as to furnish fine resolution where necessary and to coarsen elsewhere. This coarse-graining step enables the analysis of defects at a fraction of the original computational cost, without any significant loss of accuracy. Furthermore, we show that the coarse-grained solutions are convergent with respect to the spatial approximation. We illustrate the scope, versatility, efficiency and accuracy of the scheme by means of selected examples