2005
DOI: 10.1002/nme.1561
|View full text |Cite
|
Sign up to set email alerts
|

On the inverse of generalized λ‐matrices with singular leading term

Abstract: SUMMARYAn algorithm is introduced for the inverse of a -matrix given as the truncated serieswith square coefficient matrices and singular leading term A 0 . Moreover, A 1 may be conditionally singular and no restrictions are made for the remaining terms. The result is a -matrix given as a unique, truncated series of the same error order. Motivation for this problem is the evaluation of the frequency-dependent stiffness matrix of general boundary or macro-finite elements in the frame of a hybrid variational for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 41 publications
0
8
0
Order By: Relevance
“…The non-linear eigenvalue problem was firstly solved using linearization, which leads to large, although sparse, matrices. The present paper is together with References [11,16] an attempt to lay out the theoretical basis of the proposed dynamic formulation.…”
Section: Problem Justificationmentioning
confidence: 99%
See 2 more Smart Citations
“…The non-linear eigenvalue problem was firstly solved using linearization, which leads to large, although sparse, matrices. The present paper is together with References [11,16] an attempt to lay out the theoretical basis of the proposed dynamic formulation.…”
Section: Problem Justificationmentioning
confidence: 99%
“…The expression of K eff( ) in terms of transcendental functions of is only possible when the finite element boundaries coalesce to points, as for trusses and beams. The general evaluation of mass and stiffness matrices as series expansions, according to Section 3.1 and as illustrated in the following, is conceptually straightforward and applicable to large finite/boundary element families [6,12,16].…”
Section: Jacobi-davidson Algorithm For Non-linear Complex-symmetric mentioning
confidence: 99%
See 1 more Smart Citation
“…The non-normalized matrixW of either constant potentials or rigid body displacements is straightforward to construct, as given below for a discrete model with nodal points of co-ordinates (x s , y s , z s ): W = 1 1 · · · 1 T for 2D and 3D potential problems (14.25) Table 14.1 summarizes some possibilities of finite element construction in the present hybrid formulation using non-singular fundamental solutions [34]. For the static case, or for the modal advanced analysis of Section 14.4, F * 0 is singular, according to (14.14), and one must resort to the theory of generalized inverses [41,42], which is well consolidated. For 3D problems, examples are given for 4-node and 10-node tetrahedrals (Te4 and Te10) as well as for 8-node and 20-node hexahedrals (H8 and H20).…”
Section: Non-singular Fundamental Solutions In the Frequency Domainmentioning
confidence: 99%
“…However, since the product V T F * 1 V is non-singular, the inverse of F * may be obtained by an algorithm whose implementation is straightforward [42]. However, since the product V T F * 1 V is non-singular, the inverse of F * may be obtained by an algorithm whose implementation is straightforward [42].…”
Section: Advanced Modal Analysis Of the Time-dependent Problemmentioning
confidence: 99%