Pasar al contenido principal

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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.