Results 161 to 170 of about 33,431,346 (225)
Some of the next articles are maybe not open access.
Ultrasonics, 2019
A numerical method is presented for the investigation of the propagation characteristic of guided waves in functionally gradient material (FGM) plates.
Jie Gao +6 more
semanticscholar +1 more source
A numerical method is presented for the investigation of the propagation characteristic of guided waves in functionally gradient material (FGM) plates.
Jie Gao +6 more
semanticscholar +1 more source
Wave motion, 2019
A new method based on Legendre orthogonal polynomials method (LOPM) is proposed to calculate the acoustic reflection and transmission coefficients at liquid/solid interfaces.
Song Guorong +5 more
semanticscholar +1 more source
A new method based on Legendre orthogonal polynomials method (LOPM) is proposed to calculate the acoustic reflection and transmission coefficients at liquid/solid interfaces.
Song Guorong +5 more
semanticscholar +1 more source
Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
arXiv.orgThe transformer architecture has been widely applied to many machine learning tasks. A main bottleneck in the time to perform transformer computations is a task called attention computation.
Josh Alman, Zhao Song
semanticscholar +1 more source
Sommerfeld's Polynomial Method Simplified
Proceedings of the Physical Society. Section A, 1950From two earlier papers by the author it follows that eigenfunctions obtainable by Sommerfeld's polynomial method contain either a Riemann P-function or a degenerate form of it when the fundamental interval is either finite or infinite respectively.
openaire +2 more sources
2014
In this chapter we review methods for formulating partial differential equations based on the random field representations outlined in Chap. 2 These include the stochastic Galerkin method, which is the predominant choice in this book, as well as other methods that frequently occur in the literature, e.g., stochastic collocation methods and spectral ...
Mass Per Pettersson +2 more
openaire +1 more source
In this chapter we review methods for formulating partial differential equations based on the random field representations outlined in Chap. 2 These include the stochastic Galerkin method, which is the predominant choice in this book, as well as other methods that frequently occur in the literature, e.g., stochastic collocation methods and spectral ...
Mass Per Pettersson +2 more
openaire +1 more source
Proceedings of 1994 37th Midwest Symposium on Circuits and Systems, 2002
This paper describes a network formula generation method in frequency or time domain for circuits allowing symbolic representation for some or all elements. Polynomial reduction method can be used for polyvariant analysis of both linear and nonlinear networks, which can consist of admittances, impedances and all four types of controlled sources.
openaire +1 more source
This paper describes a network formula generation method in frequency or time domain for circuits allowing symbolic representation for some or all elements. Polynomial reduction method can be used for polyvariant analysis of both linear and nonlinear networks, which can consist of admittances, impedances and all four types of controlled sources.
openaire +1 more source
Continuous newton’s method for polynomials
The Mathematical Intelligencer, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Characteristic polynomial and zero polynomial with the Cochrun-Grabel method
International Journal of Circuit Theory and Applications, 1998Summary: The Cochrun-Grabel (C-G) method [\textit{B. L. Cochrun} and \textit{A. Grabel}, A method for the determination of the transfer function of electronic circuits, IEEE Trans. Circuit Theory CT-20, 16-20 (1973)] for finding the characteristic polynomial of a circuit (i.e.
Andreani, Pietro, Mattisson, Sven
openaire +2 more sources
Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials
Journal of Computational Physics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Wanzhen +5 more
openaire +2 more sources
2011
This method is based on various extensions of the following basic fact about univariate (single-variable) polynomials —known as the “factor theorem”—to the case of multivariate polynomials, that is, polynomials on many variables: (i) Every nonzero polynomial of degree d has at most d roots. (ii) For every set S of points there exists
openaire +1 more source
This method is based on various extensions of the following basic fact about univariate (single-variable) polynomials —known as the “factor theorem”—to the case of multivariate polynomials, that is, polynomials on many variables: (i) Every nonzero polynomial of degree d has at most d roots. (ii) For every set S of points there exists
openaire +1 more source