Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

Filtry

60 333 (0,591s)

Výsledek výzkumu

Pseudoinverse matrices and an analysis of methods of their numerical calculations

In this report the definition of the pseudoinverse matrix is presented and three methods of its calculation are investigated. These methods are analized with respect of the numerical stability....

BA - Obecná matematika

  • 2001
  • B
Výsledek výzkumu

Numerical methods for polynomial matrix rank evaluation.

Annotation not available...

BC - Teorie a systémy řízení

  • 1998
  • D
Výsledek výzkumu

Numerical CP Decomposition of Some Difficult Tensors

that correspond to small matrix multiplications. Here, rank of the tensors is equal to the smallest number of scalar multiplications that are necessary to accomplish the matrix optimization. Numerical results indi...

Applied mathematics

  • 2017
  • Jimp
  • Odkaz
Výsledek výzkumu

Application of the rank revealing algorithm for the calculation of the GCD

-posed problem and is connected with the determination of the numerical rank ofthe Sylvester matrix. Techniques for the calculation of the AGCD based on the least square computation are presented together with nontrivial

BA - Obecná matematika

  • 2012
  • D
Výsledek výzkumu

Comparison of algorithms for calculation of the greatest common divisor of several polynomials

The paper deals with a problem of numerical computing of the greatest common divisor of polynomials. In the paper there are compared two possible appraches base either on Sylveter or on Bezout matrices....

BA - Obecná matematika

  • 2015
  • D
  • Odkaz
Výsledek výzkumu

Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm

rank-deficient matrix. We propose a single-step method that solves both steps method findsthe rank-deficient matrix that exactly minimizes the algebraic costThe fundamental matrix can be estimated from po...

JD - Využití počítačů, robotika a její aplikace

  • 2015
  • Jx
  • Odkaz
Výsledek výzkumu

Ranks of dense alternating sign matrices and their sign patterns

In this paper, an explicit formula for the ranks of dense alternating sign matrices is obtained. The minimum rank and the maximum rank of the sign pattern of a dense alternating sign matrix are determined. Some rel...

BA - Obecná matematika

  • 2015
  • Jx
  • Odkaz
Výsledek výzkumu

Incomplete preference matrix on alo-group and its application to ranking of alternatives

A preference matrix is the result of pairwise comparison a powerful method matrix (P-matrix). We generalize the well known multiplicative and additive focus on situations where some elements of the P-matrix are m...

Statistics and probability

  • 2016
  • JSC
  • Odkaz
Výsledek výzkumu

Special matrices and Their Applications in Numerical Mathematics

Revised and corrected second edition of the book first published by the Martinus Nijhoff Publishers, Dordrecht, The Niederlands, 1986.

BA - Obecná matematika

  • 2008
  • B
Výsledek výzkumu

Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems

. Matrix Anal. Appl., 34 (2013), pp. 1--22], particularly in the rank-deficient case. We also characterize the spectrum of the preconditioned coefficient matrix by the spectral radius of the iteration matrix for th...

BA - Obecná matematika

  • 2015
  • Jx
  • Odkaz
  • 1 - 10 z 60 333