Trojan Localization Using Symbolic Algebra

2019 ◽  
pp. 99-114
Author(s):  
Farimah Farahmandi ◽  
Yuanwen Huang ◽  
Prabhat Mishra
Keyword(s):  
Symbolic Algebra

On a symbolic algebra for Hencky-Prandtl nets

1983 ◽  
Vol 94 (2) ◽  
pp. 341-350
Author(s):  
R. Hill
Keyword(s):  
General Solution ◽  
Boundary Value Problems ◽  
Classical Theory ◽  
Systematic Approach ◽  
Standard Technique ◽  
Field Equations ◽  
Infinite Matrices ◽  
Symbolic Algebra ◽  
Series Representations ◽  
Plane Deformations

AbstractIn the classical theory of plane deformations in isotropic plastic media, the field equations are hyperbolic and the orthogonal families of characteristics are known as Hencky-Prandtl nets. Their distinctive geometry has been given symbolic expression by Collins (1968), in an algebra of infinite matrices associated with canonical series representations of the general solution. This has become the standard technique when investigating boundary-value problems, both analytically and numerically. The basic framework of the algebra is here reorganized and developed. A systematic approach then leads to new identities which are shown to be fundamental in the algebraic hierarchy.

scholarly journals Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials

2019 ◽  
Vol 19 (1) ◽  
pp. 147-163 ◽  
Author(s):  
Alwin Stegeman ◽  
Lieven De Lathauwer
Keyword(s):  
Eigenvalue Problem ◽  
Simulation Study ◽  
Rayleigh Quotient ◽  
Tensor Algebra ◽  
Symbolic Algebra ◽  
Starting Values ◽  
New Methods ◽  
Sylvester Matrix ◽  
Univariate Polynomials ◽  
The Common

AbstractThe problem is considered of approximately solving a system of univariate polynomials with one or more common roots and its coefficients corrupted by noise. The goal is to estimate the underlying common roots from the noisy system. Symbolic algebra methods are not suitable for this. New Rayleigh quotient methods are proposed and evaluated for estimating the common roots. Using tensor algebra, reasonable starting values for the Rayleigh quotient methods can be computed. The new methods are compared to Gauss–Newton, solving an eigenvalue problem obtained from the generalized Sylvester matrix, and finding a cluster among the roots of all polynomials. In a simulation study it is shown that Gauss–Newton and a new Rayleigh quotient method perform best, where the latter is more accurate when other roots than the true common roots are close together.

Sign in / Sign up

Export Citation Format

Share Document