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.

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.

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.

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.

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.

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 1761 – 1780 of 3024

Showing per page

On some properties of the Laplacian matrix revealed by the RCM algorithm

Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares (2016)

Czechoslovak Mathematical Journal

In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a...

On sparsity of approximate solutions to max-plus linear systems

Pingke Li (2024)

Kybernetika

When a system of one-sided max-plus linear equations is inconsistent, the approximate solutions within an admissible error bound may be desired instead, particularly with some sparsity property. It is demonstrated in this paper that obtaining the sparsest approximate solution within a given L error bound may be transformed in polynomial time into the set covering problem, which is known to be NP-hard. Besides, the problem of obtaining the sparsest approximate solution within a given L 1 error bound...

On spectral properties of linear combinations of idempotents

Hong-Ke Du, Chun-Yan Deng, Mostafa Mbekhta, Vladimír Müller (2007)

Studia Mathematica

Let P,Q be two linear idempotents on a Banach space. We show that the closedness of the range and complementarity of the kernel (range) of linear combinations of P and Q are independent of the choice of coefficients. This generalizes known results and shows that many spectral properties of linear combinations do not depend on their coefficients.

On systems of linear algebraic equations in the Colombeau algebra

Jan Ligęza, Milan Tvrdý (1999)

Mathematica Bohemica

From the fact that the unique solution of a homogeneous linear algebraic system is the trivial one we can obtain the existence of a solution of the nonhomogeneous system. Coefficients of the systems considered are elements of the Colombeau algebra ¯ of generalized real numbers. It is worth mentioning that the algebra ¯ is not a field.

Currently displaying 1761 – 1780 of 3024