Results 261 to 270 of about 4,801,130 (303)
Functional Wet Noodles Based on Modified Cassava Flour and Pumpkin Flour: Physicochemical, Bioactive, Structural, and Starch Digestibility Characteristics. [PDF]
Int J Food SciSlamet A, Dinarto W, Sundari S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Evaluating products of matrix pencils and collapsing matrix products
Numerical Linear Algebra with Applications, 2001AbstractThis paper describes three numerical methods to collapse a formal product ofppairs of matrices$$P=\mathop{\prod}\limits_{k=0}^{p-1} E_{k}^{-1}A_{k}$$down to the product of a single pairÊ−1Â. In the setting of linear relations, the product formally extends to the case in which some of theEk's are singular and it is impossible to explicitly form ...
Peter Benner, Ralph Byers
openaire +2 more sources
On the complexity of matrix product
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002Summary: Our main result is a lower bound of \(\Omega(m^2 \log m)\) for the size of any arithmetic circuit for the product of two matrices, over the real or complex numbers, as long as the circuit does not use products with field elements of absolute value larger than 1 (where \(m\times m\) is the size of each matrix).
openaire +2 more sources
Displacements of matrix products
1995For fixed matrices M and N, either of the linear transformations A ↦ A-MAN or or A ↦ MA-AN is called a displacement of the matrix A. Displacement can greatly reduce the rank of structured matrices, such as circulant, Vandermonde, Toeplitz and Hankel matrices. This rank reduction has been widely used for inverting structured matrices.
Quyen L. Nguyen, David H. Wood
openaire +1 more source
Addition requirements for matrix and transposed matrix products
Journal of Algorithms, 1988The authors study the complexity, specifically the number of additions, of linear algorithms which compute a set of linear forms defined by a given \(s\times t\) matrix M. The developed linear algorithms are defined as labeled directed acyclic graphs.
Michael Kaminski +2 more
openaire +1 more source
Matrix product representation of locality preserving unitaries [PDF]
Physical Review B, 2018 Matrix product representation provides a useful formalism to study not only entangled states but also entangled operators in one dimension. In this paper, we focus on unitary transformations and show that matrix product operators that are unitary provide
Feng Bi +2 more
exaly +1 more source
Sparse Matrix-Matrix Products Executed Through Coloring
SIAM Journal on Matrix Analysis and Applications, 2015Summary: Sparse matrix-matrix products appear in multigrid solvers among other applications. Some implementations of these products require the inner product of two sparse vectors. In this paper, we propose a new algorithm for computing sparse matrix-matrix products by exploiting their nonzero structure through the process of graph coloring.
Michael McCourt +2 more
openaire +2 more sources
Inequalities for the trace of matrix product
IEEE Transactions on Automatic Control, 1994To obtain estimates of solutions of Lyapunov and Riccati equations which frequently occur in the stability analysis and optimal control design in linear control theory, many researchers have attempted to determine upper and lower bounds for the product of two matrices in terms of the trace of one matrix and the eigenvalues of the other.
Yuguang Fang +2 more
openaire +3 more sources
1987
Turning back to the correlation matrix Σ = (σαβ) associated, in the previous chapter, with the primitive and aperiodic substitution ζ of length q, we shall prove that Σ is the weak-star limit point of a product of matrices whose entries are trigonometric polynomials, in a way similar to the case of generalized Riesz products.
openaire +1 more source
Turning back to the correlation matrix Σ = (σαβ) associated, in the previous chapter, with the primitive and aperiodic substitution ζ of length q, we shall prove that Σ is the weak-star limit point of a product of matrices whose entries are trigonometric polynomials, in a way similar to the case of generalized Riesz products.
openaire +1 more source