Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
rank computation
Description:
The algorithmic calculation of the rank of a matrix or related mathematical object in computational mathematics and applied systems.
Related topics:
Matrix Theory and Algorithms (15%),
Polynomial and algebraic computation (12%),
Algebraic Geometry and Number Theory (9%)
OpenAlex ID:
keywords/rank-computation
Algorithms for Modular Elliptic Curves
1992
·
J. E. Cremona
·
745
Structural controllability of multiinput linear systems
1976
·
R. Shields
, J. Pearson
·
IEEE Transactions on Automatic Control
·
441
An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
1991
·
Victor Pan
, Robert Schreiber
·
SIAM Journal on Scientific and Statistical Computing
·
190
PDF
Improved sparse multivariate polynomial interpolation algorithms
1989
·
Erich Kaltofen
, Lakshman Yagati
·
Lecture notes in computer science
·
159
On Systems of Equations in a Free Group
1985
·
A A Razborov
·
Mathematics of the USSR-Izvestiya
·
156
Tensor Decompositions, State of the Art and Applications
2009
·
Comon, Pierre
·
arXiv (Cornell University)
·
150
PDF
Structural Controllability of Multi-Input Linear Systems
1975
·
R.W. Shields
, J.B. Pearson
·
Rice Research Repository (Rice University)
·
118
Tensor Decompositions: State of the Art and Applications
2002
·
Oxford University Press eBooks
·
84
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
2006
·
A. L. Chistov
·
Springer eBooks
·
78
FFPACK: finite field linear algebra package
2004
·
Jean-Guillaume Dumas
, Pascal Giorgi
, et al.
·
International Symposium on Symbolic and Algebraic Computation
·
67
Efficient and Secure Delegation of Linear Algebra.
2011
·
Payman Mohassel
·
IACR Cryptology ePrint Archive
·
66
Numerically stable algorithm for standard controllability form determination
1981
·
A. Varga
·
Electronics Letters
·
33
BOREALIS: Building Block for Sealed Bid Auctions on Blockchains
2020
·
Erik-Oliver Blass
, Florian Kerschbaum
·
ACM Asia Conference on Computer and Communications Security (ASIA CCS)
·
30
Combinatorial cobordism maps in hat Heegaard Floer theory
2008
·
Robert Lipshitz
, Ciprian Manolescu
, et al.
·
Duke Mathematical Journal
·
24
PDF
Reducing the Number of Homogeneous Linear Equations in Finding Annihilators
2006
·
Deepak Kumar Dalai
, Subhamoy Maitra
·
Lecture notes in computer science
·
19
Pipeline Monitoring Architecture Based on Observability and Controllability Analysis
2019
·
Sina Razvarz
, Cristobal Vargas-Jarillo
, et al.
·
IEEE International Conference on Mechatronics (ICM)
·
17
Asymptotically fast polynomial matrix algorithms for multivariable systems
2006
·
C.-P. Jeannerod
, G. Villard
·
International Journal of Control
·
17
PDF
The Complexity of the Inertia and Some Closure Properties of GapL
2005
·
Thanh Minh Hoang
, T. Thierauf
·
IEEE Conference on Computational Complexity (CCC)
·
17
The partitioned optical passive stars network: simulations and fundamental operations
2000
·
S. Sahni
·
IEEE Transactions on Parallel and Distributed Systems
·
17
Invertibility of Discrete-time Systems
1992
·
S. El Asml
, M. Fliess
·
IFAC Proceedings Volumes
·
17
EM-RPL: Enhanced RPL for Multigateway Internet-of-Things Environments
2020
·
Seyedreza Taghizadeh
, Halima Elbiaze
, et al.
·
IEEE Internet of Things Journal
·
16
Semiparallel rank order filtering in analog VLSI
2001
·
Boon Poh Tan
, D.M. Wilson
·
IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing
·
16
IPv6 routing protocol for low-power and lossy networks implementation in network simulator — 3
2017
·
John Patrick C. Agustin
, Joshua H. Jacinto
, et al.
·
IEEE Region 10 Conference (TENCON)
·
15
Fields and colors
2006
·
A. Baudisch
, A. Martin-Pizarro
, et al.
·
Algebra and Logic
·
15
PDF
Algorithms for normal forms for matrices of polynomials and ore polynomials
2003
·
George Labahn
, Howard Cheng
·
UWSpace (University of Waterloo)
·
15
Show more works
View as search
Works count:
144
Citation count:
2,861
Year
Topic
Type