Skip to main content

LIBRERIAS DE ALTAS PRESTACIONES PARA EL CALCULO DE FUNCIONES DE MATRICES Y APLICACIONES

TIN2017-89314-P

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2017
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 18
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Fast Taylor polynomial evaluation for the computation of the matrix cosine

  • Sastre, Jorge|||0000-0002-8612-6717
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
  • Defez Candel, Emilio|||0000-0002-3303-6371
[EN] In this work we introduce a new method to compute the matrix cosine. It is based on recent new matrix polynomial evaluation methods for the Taylor approximation and a mixed forward and backward error analysis. The matrix polynomial evaluation methods allow to evaluate the Taylor polynomial approximation of the matrix cosine function more efficiently than using Paterson-Stockmeyer method. A sequential Matlab implementation of the new algorithm is provided, giving better efficiency and accuracy than state-of-the-art algorithms. Moreover, we provide an implementation in Matlab that can use NVIDIA CPUs easily and efficiently. (C) 2018 Elsevier B.V. All rights reserved., This work has been partially supported by Spanish Ministerio de Economía y Competitividad and European Regional Development Fund (ERDF) grants TIN2014-59294-P, and TIN2017-89314-P.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Efficient Evaluation of Matrix Polynomials beyond the Paterson-Stockmeyer Method

  • Sastre, Jorge|||0000-0002-8612-6717
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
[EN] Recently, two general methods for evaluating matrix polynomials requiring one matrix product less than the Paterson-Stockmeyer method were proposed, where the cost of evaluating a matrix polynomial is given asymptotically by the total number of matrix product evaluations. An analysis of the stability of those methods was given and the methods have been applied to Taylor-based implementations for computing the exponential, the cosine and the hyperbolic tangent matrix functions. Moreover, a particular example for the evaluation of the matrix exponential Taylor approximation of degree 15 requiring four matrix products was given, whereas the maximum polynomial degree available using Paterson-Stockmeyer method with four matrix products is 9. Based on this example, a new family of methods for evaluating matrix polynomials more efficiently than the Paterson-Stockmeyer method was proposed, having the potential to achieve a much higher efficiency, i.e., requiring less matrix products for evaluating a matrix polynomial of certain degree, or increasing the available degree for the same cost. However, the difficulty of these family of methods lies in the calculation of the coefficients involved for the evaluation of general matrix polynomials and approximations. In this paper, we provide a general matrix polynomial evaluation method for evaluating matrix polynomials requiring two matrix products less than the Paterson-Stockmeyer method for degrees higher than 30. Moreover, we provide general methods for evaluating matrix polynomial approximations of degrees 15 and 21 with four and five matrix product evaluations, respectively, whereas the maximum available degrees for the same cost with the Paterson-Stockmeyer method are 9 and 12, respectively. Finally, practical examples for evaluating Taylor approximations of the matrix cosine and the matrix logarithm accurately and efficiently with these new methods are given., This research was partially funded by the European Regional Development Fund (ERDF) and the Spanish Ministerio de Economia y Competitividad grant TIN2017-89314-P, and by the Programa de Apoyo a la Investigacion y Desarrollo 2018 of the Universitat Politecnica de Valencia grant PAID-06-18-SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

New Hermite series expansion for computing the matrix hyperbolic cosine

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
[EN] There are, currently, very few implementations to compute the hyperbolic cosine of a matrix. This work tries to fill this gap. To this end, we first introduce both a new rational-polynomial Hermite matrix expansion and a formula for the forward relative error of Hermite approximation in exact arithmetic with a sharp bound for the forward error. This matrix expansion allows obtaining a new accurate and efficient method for computing the hyperbolic matrix cosine. We present a MATLAB implementation, based on this method, which shows a superior efficiency and a better accuracy than other state-of-the-art methods. The algorithm developed on the basis of this method is also able to run on an NVIDIA GPU thanks to a MEX file that connects the MATLAB implementation to the CUDA code., This work has been partially supported by Spanish Ministerio de Economia, Industria y Competitividad and European Regional Development Fund (ERDF) grants TIN2017-89314-P and by the Programa de Apoyo a la Investigacion y Desarrollo 2018 of the Universitat Politecnica de Valencia, Spain (PAID-06-18) grants SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An efficient and accurate algorithm for computing the matrix cosine based on New Hermite approximations

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
  • Sastre, Jorge|||0000-0002-8612-6717
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
[EN] In this work we introduce new rational-polynomial Hermite matrix expansions which allow us to obtain a new accurate and efficient method for computing the matrix cosine. This method is compared with other state-of-the-art methods for computing the matrix cosine, including a method based on Pade approximants, showing a far superior efficiency, and higher accuracy. The algorithm implemented on the basis of this method can also be executed either in one or two NVIDIA GPUs, which demonstrates its great computational capacity. (C) 2018 Elsevier B.V. All rights reserved., This work has been partially supported by Spanish Ministerio de Economia y Competitividad and European Regional Development Fund (ERDF) grants TIN2014-59294-P, and T1N2017-89314-P.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Metamaterial acoustics on the (2+ 1)D Einstein cylinder

  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
[EN] The Einstein cylinder is the first cosmological model for our universe in modern history. Its geometry not only describes a static universe-a universe being invariant under time reversal-but it is also the prototype for a maximally symmetric spacetime with constant positive curvature. As such, it is still of crucial importance in numerous areas of physics and engineering, offering a fruitful playground for simulations and new theories. Here, we focus on the implementation and simulation of acoustic wave propagation on the Einstein cylinder. Engineering such an extraordinary device is the territory of metamaterial science, and we will propose an appropriate tuning of the relevant acoustic parameters in such a way as to mimic the geometric properties of this spacetime in acoustic space. Moreover, for probing such a space, we derive the corresponding wave equation from a variational principle for the underlying curved spacetime manifold and examine some of its solutions. In particular, fully analytical results are obtained for concentric wave propagation. We present predictions for this case and thereby investigate the most significant features of this spacetime. Finally, we produce simulation results for a more sophisticated test model which can only be tackled numerically., This work has been supported by the Spanish Ministerio de Economia y Competitividad, the European Regional Development Fund (ERDF) under grant TIN2017-89314-P, and the Programa de Apoyo a la Investigacion y Desarrollo 2018 (PAID-06-18) of the Universitat Politecnica de Valencia under grant SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Advances in the Approximation of the Matrix Hyperbolic Tangent

  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Sastre, Jorge|||0000-0002-8612-6717
  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
[EN] In this paper, we introduce two approaches to compute the matrix hyperbolic tangent. While one of them is based on its own definition and uses the matrix exponential, the other one is focused on the expansion of its Taylor series. For this second approximation, we analyse two different alternatives to evaluate the corresponding matrix polynomials. This resulted in three stable and accurate codes, which we implemented in MATLAB and numerically and computationally compared by means of a battery of tests composed of distinct state-of-the-art matrices. Our results show that the Taylor series-based methods were more accurate, although somewhat more computationally expensive, compared with the approach based on the exponential matrix. To avoid this drawback, we propose the use of a set of formulas that allows us to evaluate polynomials in a more efficient way compared with that of the traditional Paterson¿Stockmeyer method, thus, substantially reducing the number of matrix products (practically equal in number to the approach based on the matrix exponential), without penalising the accuracy of the result, This research was funded by the Spanish Ministerio de Ciencia e Innovacion under grant number TIN2017-89314-P.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the inverse of the Caputo matrix exponential

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Chen-Charpentier, Benito M.
[EN] Matrix exponentials are widely used to efficiently tackle systems of linear differential equations. To be able to solve systems of fractional differential equations, the Caputo matrix exponential of the index a > 0 was introduced. It generalizes and adapts the conventional matrix exponential to systems of fractional differential equations with constant coefficients. This paper analyzes the most significant properties of the Caputo matrix exponential, in particular those related to its inverse. Several numerical test examples are discussed throughout this exposition in order to outline our approach. Moreover, we demonstrate that the inverse of a Caputo matrix exponential in general is not another Caputo matrix exponential., This work has been partially supported by Spanish Ministerio de Economia y Competitividad and European Regional Development Fund (ERDF) grants TIN2017-89314-P and by the Programa de Apoyo a la Investigacion y Desarrollo 2018 of the Universitat Politecnica de Valencia (PAID-06-18) grant SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the Approximated Solution of a Special Type of Nonlinear Third-Order Matrix Ordinary Differential Problem

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
  • Real-Herraiz, Teresa Pilar|||0000-0003-2578-2902
[EN] Matrix differential equations are at the heart of many science and engineering problems. In this paper, a procedure based on higher-order matrix splines is proposed to provide the approximated numerical solution of special nonlinear third-order matrix differential equations, having the form Y-(3)(x)=f(x,Y(x)). Some numerical test problems are also included, whose solutions are computed by our method., This research was partially funded by the European Regional Development Fund (ERDF) and the Spanish Ministerio de Economia y Competitividad Grant TIN2017-89314-P
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Accurate approximation of the Hyperbolic matrix cosine using Bernoulli matrix polynomials

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
  • Sastre, Jorge|||0000-0002-8612-6717
[EN] The evaluation of matrix functions plays an important and relevant role in many scientific applications because matrix functions have proven to be an ecient tool in applications such as reduced order models [1], [2, pp. 275¿303], image denoising [3] and graph neural networks [4], among others.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An Improved Taylor Algorithm for Computing the Matrix Logarithm

  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Sastre, Jorge|||0000-0002-8612-6717
  • Ruíz Martínez, Pedro Antonio|||0000-0001-9215-5437
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Defez Candel, Emilio|||0000-0002-3303-6371
[EN] The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pade approximation, sometimes accompanied by the Schur decomposition. In this work, we present a Taylor series algorithm, based on the free-transformation approach of the inverse scaling and squaring technique, that uses recent matrix polynomial formulas for evaluating the Taylor approximation of the matrix logarithm more efficiently than the Paterson-Stockmeyer method. Two MATLAB implementations of this algorithm, related to relative forward or backward error analysis, were developed and compared with different state-of-the art MATLAB functions. Numerical tests showed that the new implementations are generally more accurate than the previously available codes, with an intermediate execution time among all the codes in comparison., This research was funded by the European Regional Development Fund (ERDF) and the Spanish Ministerio de Economia y Competitividad Grant TIN2017-89314-P.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On Bernoulli series approximation for the matrix cosine

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
[EN] This paper presents a new series expansion based on Bernoulli matrix polynomials to approximate the matrix cosine function. An approximation based on this series is not a straightforward exercise since there exist different options to implement such a solution. We dive into these options and include a thorough comparative of performance and accuracy in the experimental results section that shows benefits and downsides of each one. Also, a comparison with the Pade approximation is included. The algorithms have been implemented in MATLAB and in CUDA for NVIDIA GPUs., Spanish Ministerio de Economia y Competitividad and European Regional Development Fund, Grant/Award Number: TIN2017-89314-P; Universitat Politecnica de Valencia, Grant/Award Number: SP20180016
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On Bernoulli Matrix Polynomials and Matrix Exponential Approximation

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
[EN] We present in this paper a new method based on Bernoulli matrix polynomials to approximate the exponential of a matrix. The developed method has given rise to two new algorithms whose efficiency and precision are compared to the most efficient implementations that currently exist. For that, a state-of-the-art test matrix battery, that allows deeply exploring the highlights and downsides of each method, has been used. Since the new algorithms proposed here do make an intensive use of matrix products, we also provide a GPUs-based implementation that allows to achieve a high performance thanks to the optimal implementation of matrix multiplication available on these devices. (c) 2020 Elsevier B.V. All rights reserved, This work has been partially supported by Spanish Ministerio de Economia y Competitividad and European Regional Development Fund (ERDF) grants TIN2017-89314-P and by the Programa de Apoyo a la Investigacion y Desarrollo 2018 of the Universitat Politecnica de Valencia (PAID-06-18) grants SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Efficient update of determinants of rmany-electron wave function overlaps

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Davidovic, Davor
  • Sapunar, Marin
  • Herrero, Jose R.
[EN] The calculation of overlaps between many-electron wave functions at different nuclear geometries during nonadiabatic dynamics simulations requires the evaluation of a large number of determinants of matrices that differ only in a few rows/columns. While this calculation is fast for small systems, its cost grows faster than the alternative electronic structure calculation used to obtain the wave functions. For wave functions that can be written as a CIS expansion, all determinants can be computed using the set of level-2 minors of the reference matrix. However, this is still a costly computation for large systems. In this paper, we provide an algorithm for efficiently calculating all level-2 minors of a matrix by re-utilizing and updating the LU factorization for the determinants of the minors. This approach results in a parallel version of the algorithm that is up to an order of magnitude faster then the current best parallel implementation. The algorithm thus allows the computation of exact wave function overlaps for relatively large systems, with a high density of states, at virtually no cost compared with the electronic structure calculations. Furthermore, the new algorithm opens the path to further investigations in efficient computing of the exact wave function overlaps for complex wave functions such as MR-CIS and MR-CISD. Program summary Program Title: CIS Overlap Licensing provisions: MIT Programming language: FORTRAN 2008, C Nature of problem: Calculation of overlaps between CIS type wave functions at different nuclear geometries during nonadiabatic dynamics simulation requires calculating a large number of connected determinants and scales with the seventh power of the size of the system being studied. Without additional approximations, for large systems this computation becomes more costly than the electronic structure calculation used to obtain the wave functions. Solution method: All of the determinants required for a CIS wave function overlap calculation can be derived from the set of all level-2 minors of the matrix of overlaps between the reference Slater determinants. We developed an algorithm for efficiently computing all level-2 minors of a matrix. This part of the computational process was the bottleneck in previous solutions to the problem and is now an order of magnitude faster resulting in significantly faster overall calculation of the wave function overlaps., Enrique S. Quintana-Orti was supported by project TIN2017-82972-R, Pedro Alonso-Jorda by project TIN2017-89314-P-AR, and Jose R. Herrero by project TIN2015-65316-P, all of the MINECO and FEDER. The latter was also funded by the Generalitat de Catalunya (contract 2017-SGR-1414). Marin Sapunar and Davor Davidovic were supported by Croatian Science Foundation under grant HRZZ IP-2016-06-1142.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The relativistic harmonic oscillator in a uniform gravitational field

  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
[EN] We present the relativistic generalization of the classical harmonic oscillator suspended within a uniform gravitational field measured by an observer in a laboratory in which the suspension point of the spring is fixed. The starting point of this analysis is a variational approach based on the Euler-Lagrange formalism. Due to the conceptual differences of mass in the framework of special relativity compared with the classical model, the correct treatment of the relativistic gravitational potential requires special attention. It is proved that the corresponding relativistic equation of motion has unique periodic solutions. Some approximate analytical results including the next-to-leading-order term in the non-relativistic limit are also examined. The discussion is rounded up with a numerical simulation of the full relativistic results in the case of a strong gravity field. Finally, the dynamics of the model is further explored by investigating phase space and its quantitative relativistic features., This work has been supported by the Spanish Ministerio de Economia y Competitividad, the European Regional Development Fund (ERDF) under grant TIN2017-89314-P, and the Programa de Apoyo a la Investigacion y Desarrollo 2018 (PAID-06-18) of the Universitat Politecnica de Valencia under grant SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Metamaterial acoustics on the Poincaré disk

  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
[EN] Historically, the Poincare disk model has taken a pioneering role in the development of non-Euclidean geometry. But still today, this model is critical as a playground for simulations and new theories. In this paper, we discuss how to implement and simulate acoustic wave phenomena on the Poincare disk with the help of so-called metamaterials. After formally developing a theory based on the acoustic potential for the curved spacetime of the Poincare model, we also provide practical instructions on how to manufacture the appropriate metadevice in a laboratory environment. Finally, as an example, analytical results for the nontrivial radial contributions in concentric wave propagation are derived, and the corresponding numerical predictions are presented., Spanish Ministerio de Economia y Competitividad, the European Regional Development Fund (ERDF), Grant/Award Number: TIN2017-89314-P; Programa de Apoyo a la Investigacion y Desarrollo 2018, Grant/Award Number: PAID-06-18
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Acoustics on the Poincaré Disk

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Simulation of Harmonic Oscillators on the Lattice

  • Tung, Michael Ming-Sha|||0000-0002-8760-0927
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Sastre, Jorge|||0000-0002-8612-6717
[EN] This work deals with the simulation of a two¿dimensional ideal lattice having simple tetragonal geometry. The harmonic character of the oscillators give rise to a system of second¿order linear differential equations, which can be recast into matrix form. The explicit solutions which govern the dynamics of this system can be expressed in terms of matrix trigonometric functions. For the derivation we employ the Lagrangian formalism to determine the correct solutions, which extremize the underlying action of the system. In the numerical evaluation we develop diverse state¿of¿the¿art algorithms which efficiently tackle equations with matrix sine and cosine functions. For this purpose, we introduce two special series related to trigonometric functions. They provide approximate solutions of the system through a suitable combination. For the final computation an algorithm based on Taylor expansion with forward and backward error analysis for computing those series had to be devised. We also implement several MATLAB programs which simulate and visualize the two¿dimensional lattice and check its energy conservation., This work has been supported by the Spanish Ministerio de Economia y Competitividad, the European Regional Development Fund (ERDF) under grant TIN2017-89314-P, and the Programa de Apoyo a la Investigacion y Desarrollo 2018 (PAID-06-18) of the Universitat Politecnica de Valencia under grant SP20180016.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

New matrix series expansions for the matrix cosine approximation

  • Defez Candel, Emilio|||0000-0002-3303-6371
  • Ibáñez González, Jacinto Javier|||0000-0002-6912-4453
  • Alonso Abalos, José Miguel|||0000-0001-6812-7364
  • Peinado Pinilla, Jesús|||0000-0002-9048-5106
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
This work has been partially supported by Spanish Ministerio de Economia y Competitividad and European Regional Development Fund (ERDF) grants TIN2017-89314-P and by the Programa de Apoyo a la Investigacion y Desarrollo 2018 of the Universitat Politecnica de Valencia (PAID-06-18) grants SP20180016.