English
Related papers

Related papers: A simple and fast algorithm for computing exponent…

200 papers

Small signal analysis is a special case of analytical approaches using Taylor expansions of power system differential equations with the truncation performed at order one. The truncated Taylor expansions (TTEs) at higher orders can lead to…

Systems and Control · Computer Science 2018-11-05 Bin Wang , Xin Xu , Kai Sun

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

Mathematical Physics · Physics 2008-11-18 D H Gebremedhin , C A Weatherford , X Zhang , A Wynn , G Tanaka

We estimate the truncated double trigonometric series $\sum_{n=0}^{N}\sum_{m=0}^{M}a_{mn} {e}^{2\pi \imath \left(m x+n y\right)}$, $a_{mn} \in\mathbb{C}$, in Lebesgue spaces with mixed norms in terms of the $p^{th}-q^{th}$ power finite…

Functional Analysis · Mathematics 2015-07-14 Ahmed A. Abdelhakim

We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…

Algebraic Geometry · Mathematics 2015-06-10 Marta Abril Bucero , Chandrajit Bajaj , Bernard Mourrain

We study the use of the quantum wavelet transform to extract efficiently information about the multifractal exponents for multifractal quantum states. We show that, combined with quantum simulation algorithms, it enables to build quantum…

Quantum Physics · Physics 2009-09-24 I. Garcia-Mata , O. Giraud , B. Georgeot

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

Data Structures and Algorithms · Computer Science 2022-08-02 Mitali Bafna , Jun-Ting Hsieh , Pravesh K. Kothari , Jeff Xu

The $E_2$ term of the Adams spectral sequence may be identified with certain derived functors, and this also holds for a number of other spectral sequences. Our goal is to show how the higher terms of such spectral sequences are determined…

Algebraic Topology · Mathematics 2024-12-31 Hans-Joachim Baues , David Blanc , Boris Chorny

The reciprocal of $e^{-x}$ has a power series about $0$ in which all coefficients are non-negative. Gessel [Reciprocals of exponential polynomials and permutation enumeration, Australas. J. Combin., 74, 2019] considered truncates of the…

Combinatorics · Mathematics 2023-05-25 David Galvin , John Engbers , Clifford Smyth

We introduce a fast and easy-to-implement simulation algorithm for a multivariate normal distribution truncated on the intersection of a set of hyperplanes, and further generalize it to efficiently simulate random variables from a…

Computation · Statistics 2017-02-21 Yulai Cong , Bo Chen , Mingyuan Zhou

We provide an efficient algorithm for the classical problem, going back to Galton, Pearson, and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples…

Statistics Theory · Mathematics 2020-10-26 Constantinos Daskalakis , Themis Gouleakis , Christos Tzamos , Manolis Zampetakis

In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…

Number Theory · Mathematics 2010-03-15 Anthony Flatters

This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions. The idea in itself is…

Logic in Computer Science · Computer Science 2024-02-14 Beniamino Accattoli

A commonly used technique for the higher-order PageRank problem is the power method that is computationally intractable for large-scale problems. The truncated power method proposed recently provides us with another idea to solve this…

Numerical Analysis · Mathematics 2021-05-11 Jun Huang , Gang Wu

The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the…

Numerical Analysis · Mathematics 2015-02-27 D. A. Bini , S. Dendievel , G. Latouche , B. Meini

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

Combinatorics · Mathematics 2013-06-25 Edinah K. Gnang , Doron Zeilberger

I present and discuss an extremely simple algorithm for expanding a formal power series as a continued fraction. This algorithm, which goes back to Euler (1746) and Viscovatov (1805), deserves to be better known. I also discuss the…

Combinatorics · Mathematics 2023-07-03 Alan D. Sokal

We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…

Combinatorics · Mathematics 2021-10-19 Carlos A. A. Florentino

We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…

Algebraic Geometry · Mathematics 2017-10-23 Bernard Mourrain

Several years ago the second author playing with different "recognizers of real constants", e.g., the LLL algorithm, the Plouffe inverter, etc. found empirically the following formula. Let $p_n/q_n$ denote the $n$th convergent of the…

Number Theory · Mathematics 2014-08-14 Jean-Paul Allouche , Thomas Baruchel

This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…

Data Structures and Algorithms · Computer Science 2013-01-07 Lorenzo Pasquini