✦ LIBER ✦

Orthogonality and its approximation in the analysis of asymmetry

✍ Scribed by J.C. Gower; B. Zeilman

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 671 KB
Volume: 278
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10090-8

No coin nor oath required. For personal study only.

✦ Synopsis

Given a square matrix A, we discuss the problem of seeking some constrained matrix C which satisfies (i) A + C =M and (ii) AC=M where M is symmetric, or nearly so.

Typical constraints on C include low rank, orthogonality

and low-rank departures from a unit matrix. Graphical representation is discussed.

📜 SIMILAR VOLUMES

Padé approximation and its application i

Padé approximation and its application in time series analysis

✍ Kuldeep Kumar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 531 KB

Properties and performance of orthogonal

Properties and performance of orthogonal neural network in function approximation

✍ Chieh F. Sher; Ching-Shiow Tseng; Chen-San Chen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

Backpropagation neural network has been applied successfully to solving uncertain problems in many fields. However, unsolved drawbacks still exist such as the problems of local minimum, slow convergence speed, and the determination of initial weights and the number of processing elements. In this pa

Limitation of average eshelby tensor and

Limitation of average eshelby tensor and its application in analysis of ellipse approximation

✍ Wennan Zou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 236 KB

By the aid of irreducible decomposition, the average Eshelby tensor can be expressed by two complex coefficients in 2D Eshelby problem. This paper proved the limitation of complex coefficients based on the span of elastic strain energy density. More discussions yielded the constraints on the samplin

Function-valued Padé-type approximant vi

Function-valued Padé-type approximant via the formal orthogonal polynomials and its applications in solving integral equations

✍ Chuanqing Gu; Jindong Shen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 450 KB

A kind of function-valued Padé-type approximant via the formal orthogonal polynomials (FPTAVOP) is introduced on the polynomial space and an algorithm is sketched by means of the formal orthogonal polynomials. This method can be applied to approximate characteristic values and the corresponding char

Orthogonality of the tangent space and n

Orthogonality of the tangent space and normal space and its application in the dynamics of the constrained system

✍ Peilin Song; Xingrui Ma 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Orthogonal considerations in the design

Orthogonal considerations in the design of neural networks for function approximation

✍ B. Francois 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Two problems occur in the design of feedforward neural networks: the choice of the optimal architecture and the initialization. Generally, input and output data of a system (or a function) are measured and recorded. Then, experimenters wish to design a neural network to map exactly these output valu