Results 261 to 270 of about 36,916 (300)
Aequationes Mathematicae, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pawel Wójcik, Jacek Chmieliński
exaly +3 more sources
Some of the next articles are maybe not open access.
On the Orthogonality of Classical Orthogonal Polynomials
Integral Transforms and Special Functions, 2003We consider the orthogonality of rational functions W n ( s ) as the Laplace transform images of a set of orthoexponential functions, obtained from the Jacobi polynomials, and as the Laplace transform images of the Laguerre polynomials. We prove that the orthogonality of the Jacobi and the Laguerre polynomials is induced by the orthogonality of the ...
Slobodan TriČkoviĆ, Miomir StankoviĆ
openaire +1 more source
Univocal or Orthogonal Estimators of Orthogonal Factors
Psychometrika, 1963The defects of the least-squares or multiple-regression equation approach to estimating orthogonal factors are discussed and transformations of the beta weights are derived which remove these defects with minimum loss in correlations between estimators and true factor scores.
openaire +2 more sources
Orthogonal sets; orthogonal contractions
Asian-European Journal of Mathematics, 2019In this paper, we are interested in obtaining fixed point theorems by keeping the orthogonal completeness of the orthogonal metric space and replacing the [Formula: see text]-contraction condition in theorems by another slightly modified conditions. The paper contains an example illustrating our results.
Eshaghi Gordji, Madjid +2 more
openaire +2 more sources
Proceedings of the seventh annual symposium on Computational geometry - SCG '91, 1991
Any tree, with \(n\) edges and \(n + 1\) vertices, can be realized in Euclidean \(n\)-space so that its edges, of any chosen lengths, are mutually perpendicular. The convex hull of such an orthogonal tree is an orthogonal simplex whose dihedral angles include \((\begin{smallmatrix} n \\2 \end{smallmatrix})\) right angles. More precisely, each vertex of
openaire +3 more sources
Any tree, with \(n\) edges and \(n + 1\) vertices, can be realized in Euclidean \(n\)-space so that its edges, of any chosen lengths, are mutually perpendicular. The convex hull of such an orthogonal tree is an orthogonal simplex whose dihedral angles include \((\begin{smallmatrix} n \\2 \end{smallmatrix})\) right angles. More precisely, each vertex of
openaire +3 more sources
1966
Publisher Summary This chapter focuses on simple sets of orthogonal polynomials. These sets of polynomials arise in various ways, one of which is as the solutions of a class of differential equations. It has been shown that, under certain conditions, given any interval and a positive weight function on that interval, there exists a corresponding set ...
openaire +1 more source
Publisher Summary This chapter focuses on simple sets of orthogonal polynomials. These sets of polynomials arise in various ways, one of which is as the solutions of a class of differential equations. It has been shown that, under certain conditions, given any interval and a positive weight function on that interval, there exists a corresponding set ...
openaire +1 more source
Orthogonal and non-orthogonal hybrids
Journal of Molecular Structure: THEOCHEM, 1988Abstract Ab initio MO wave functions for XHn molecules are analyzed in terms of the hybridization concept. It was found that for X from the first row (especially for carbon) the hybrid-AOs so obtained are close to orthogonal. If X is from the second row, different hybrids on the same atom overlap strongly and the well-known relations between degree ...
openaire +1 more source
2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2019
Domain-wall memory (DWM), also known as Racetrack memory, is a new kind of spintronic memory that extends the concept of spin-transfer torque magnetic memory, a high storage capacity and high speed, comparable with STT-RAM. Using the novel Transverse Read (TR), this paper presents new and rising possibilities for DWM.
Sébastien Ollivier +5 more
openaire +2 more sources
Domain-wall memory (DWM), also known as Racetrack memory, is a new kind of spintronic memory that extends the concept of spin-transfer torque magnetic memory, a high storage capacity and high speed, comparable with STT-RAM. Using the novel Transverse Read (TR), this paper presents new and rising possibilities for DWM.
Sébastien Ollivier +5 more
openaire +2 more sources
Journal of Mathematical Physics, 1970
An essentially unique method of forming an orthonormalized set of vectors from an independent set of n vectors is presented. The resulting set is proven to maximize a certain quartic form in the original vectors.
Schweinler, H. C., Wigner, Eugene P.
openaire +1 more source
An essentially unique method of forming an orthonormalized set of vectors from an independent set of n vectors is presented. The resulting set is proven to maximize a certain quartic form in the original vectors.
Schweinler, H. C., Wigner, Eugene P.
openaire +1 more source
Journal of Mathematics and Physics, 1933
Orthogonale Matrizes vom Grade \( m \), deren Elemente alle gleich \(\pm 1\) sind, sind (von den Fällen \( m=1 \) und \( m=2 \) abgesehen) nur möglich, wenn \( m \) durch 4 teilbar ist. Für \( m=2^{k} \) gab Sylvester Beispiele. Verf. gibt Beispiele für die folgenden Fälle: \( m=p+1[p \) prim \( ] ; m=2^{k}(p+1) ; m=2^{k}\left(p^{k}+1\right)[p ...
openaire +2 more sources
Orthogonale Matrizes vom Grade \( m \), deren Elemente alle gleich \(\pm 1\) sind, sind (von den Fällen \( m=1 \) und \( m=2 \) abgesehen) nur möglich, wenn \( m \) durch 4 teilbar ist. Für \( m=2^{k} \) gab Sylvester Beispiele. Verf. gibt Beispiele für die folgenden Fälle: \( m=p+1[p \) prim \( ] ; m=2^{k}(p+1) ; m=2^{k}\left(p^{k}+1\right)[p ...
openaire +2 more sources