On the function “sandwiched" between and .
Dobrynin, V.Y. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.”
On the function “sandwiched" between and .
The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Low rank co-diagonal matrices and Ramsey graphs.
Grolmusz, Vince (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Direct methods for matrix Sylvester and Lyapunov equations.
Sorensen, Danny C., Zhou, Yunkai (2003)
Journal of Applied Mathematics
Similarity:
Elimination on sparse symmetric systems of a special structure
Jitka Segethová (1972)
Aplikace matematiky
Similarity:
Thin Lehman matrices and their graphs.
Wang, Jonathan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on direct methods for approximations of sparse Hessian matrices
Miroslav Tůma (1988)
Aplikace matematiky
Similarity:
Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.