Search Results - Numerical Algorithms and Problem Complexity
-
1
Authors:
Source: Numerical Algorithms. 97:1635-1672
Subject Terms: hierarchical matrices, 68Q25, 68R10, 68U05, 45B05, 68U20, \(N\)-body problems, HODLR, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), FOS: Mathematics, Fredholm integral equations, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Simulation
File Description: application/xml
-
2
Authors:
Source: Mathematical Programming. 205:431-483
Subject Terms: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, stochastic optimization, nonlinear optimization, sequential quadratic optimization, worst-case complexity, 49M37, 65K05, 65K10, 90C15, 90C30, 90C55, Methods of successive quadratic programming type, Complexity and performance of numerical algorithms, Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Analysis of algorithms, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control
File Description: application/xml
-
3
Authors:
Source: SIAM Journal on Discrete Mathematics. 6:57-69
Subject Terms: Polynomial algorithms, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, computational complexity, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Analysis of algorithms and problem complexity, sparse matrices, 0211 other engineering and technologies, bipartite matching, 0102 computer and information sciences, 02 engineering and technology, NP-hard, 01 natural sciences
File Description: application/xml
-
4
Authors: Heinrich, Stefan
Source: Journal of Complexity. 81:101821
Subject Terms: algorithm, Analysis of algorithms and problem complexity, adaptive, Parameterized complexity, tractability and kernelization, Communication complexity, information complexity, Numerical Analysis (math.NA), General theory of numerical analysis in abstract spaces, Complexity and performance of numerical algorithms, information-based complexity, Algorithms for approximation of functions, randomized, vector-valued mean, FOS: Mathematics, nonadaptive, Mathematics - Numerical Analysis
File Description: application/xml
Access URL: http://arxiv.org/abs/2306.13471
-
5
Authors: N. M. Popov
Source: Computational Mathematics and Modeling. 12:137-156
Subject Terms: scalar global optimization problem, Complexity and performance of numerical algorithms, Analysis of algorithms and problem complexity, 0101 mathematics, Lipschitzian multi-criterion problems, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), informational complexity
File Description: application/xml
-
6
Authors:
Source: Acta Mathematica Scientia. 25:439-448
Subject Terms: Complexity and performance of numerical algorithms, error estimates, Analysis of algorithms and problem complexity, Numerical integration, functional approximation, average case setting, 0101 mathematics, 01 natural sciences, Approximate quadratures
File Description: application/xml
-
7
Authors:
Source: IEEE Transactions on Computers. :1180-1194
Subject Terms: Analysis of algorithms and problem complexity, algorithm performance, parallel algorithms, parallel architectures, cost of data movement in parallel numerical algorithms, system performance, 02 engineering and technology, 01 natural sciences, shared memory multiprocessors, Theory of operating systems, highly parallel nonshared memory MIMD systems, Applications of graph theory to circuits and networks, communication network design, 0202 electrical engineering, electronic engineering, information engineering, numerical software, 0101 mathematics, Algorithms in computer science, VLSI complexity, interconnection networks
File Description: application/xml
Access URL: https://ntrs.nasa.gov/api/citations/19840024988/downloads/19840024988.pdf
https://zbmath.org/3870592
https://doi.org/10.1109/tc.1984.1676393
https://ntrs.nasa.gov/search.jsp?R=19850035195
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000001676393
https://dl.acm.org/doi/10.1109/TC.1984.1676393
http://ieeexplore.ieee.org/document/1676393/
https://ieeexplore.ieee.org/document/1676393/
https://repository.exst.jaxa.jp/dspace/handle/a-is/393916 -
8
Authors:
Source: Approximation Theory and its Applications. 14:1-7
Subject Terms: Complexity and performance of numerical algorithms, shift-invariant problem, Analysis of algorithms and problem complexity, finite element method, average case complexity, Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, General theory of numerical analysis in abstract spaces
File Description: application/xml
-
9
Authors: Arthur G. Werschulz
Source: Journal of Complexity. 9:154-170
Subject Terms: Numerical solution of boundary value problems involving ordinary differential equations, Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations, Analysis of algorithms and problem complexity, Applied Mathematics, \(h\)-version, two-point boundary value problem, error estimate, error bounds, 01 natural sciences, Complexity and performance of numerical algorithms, finite element, Linear boundary value problems for ordinary differential equations, \(p\)-version, 0101 mathematics, complexity
File Description: application/xml
-
10
Authors: Knut Petras
Source: Journal of Complexity. 14:302-318
Subject Terms: Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, Analysis of algorithms and problem complexity, Applied Mathematics, Interval and finite arithmetic, self-correcting algorithm, interval arithmetic, Symbolic computation and algebraic computation, Numerical quadrature and cubature formulas, automatic differentiation, 01 natural sciences, functions with singularities, Complexity and performance of numerical algorithms, quadrature, 0101 mathematics, complexity
File Description: application/xml
Access URL: https://zbmath.org/1236202
https://doi.org/10.1006/jcom.1998.0478
https://core.ac.uk/display/82754114
https://dblp.uni-trier.de/db/journals/jc/jc14.html#Petras98
https://www.sciencedirect.com/science/article/pii/S0885064X98904782#!
https://www.sciencedirect.com/science/article/pii/S0885064X98904782 -
11
Authors: Henryk Woźniakowski
Source: Journal of Complexity. 8:93-123
Subject Terms: Statistics and Probability, Numerical Analysis, Banach space, Algebra and Number Theory, Control and Optimization, Analysis of algorithms and problem complexity, Applied Mathematics, linear continuous functional, General theory of numerical analysis in abstract spaces, 01 natural sciences, error tolerance, Complexity and performance of numerical algorithms, computing, Gaussian measure, complexity of computation, information-based complexity, worst case complexity, probabilistic complexity, 0101 mathematics, verifying
File Description: application/xml
-
12
Authors: et al.
Source: EUREKA: Physics and Engineering. (4):29-39
Subject Terms: Illinois algorithm, Regula Falsi algorithm, electrical parameters, PV cell, load resistance
File Description: electronic
-
13
Authors:
Source: Information Processing Letters. 45:159-163
Subject Terms: Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, minimum spanning tree, 01 natural sciences, Trees, components, undirected graph, parallel algorithm, Graph theory (including graph drawing) in computer science, non-numerical algorithms, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, complexity, sorting
File Description: application/xml
-
14
Authors: et al.
Source: International Journal of High Speed Computing. :31-62
Subject Terms: Complexity and performance of numerical algorithms, Analysis of algorithms and problem complexity, Parallel numerical computation, parallel computation, numerical scientific computing, Alliant FX/8 multiprocessor, performance prediction, Lawrence Livermore Loops
File Description: application/xml
-
15
Authors:
Source: Information Processing Letters. 50:129-136
Subject Terms: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, Parallel numerical computation, 02 engineering and technology, wormhole routing communication
File Description: application/xml
-
16
Authors: et al.
Contributors: et al.
Source: ISSN: 2327-5219.
Subject Terms: Branch and Bound, Partial Minimum Spanning Hierarchy, Hierarchy, Multi-Constrained Steiner Problem, Quality of Service, Multicast Routing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
17
Authors:
Source: J. Complexity 2005;21(4):502-531
Biblioteca Digital (UBA-FCEN)
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCENSubject Terms: Statistics and Probability, positive solutions, Control and Optimization, Analysis of algorithms and problem complexity, Numerical computation of solutions to systems of equations, 0102 computer and information sciences, Symbolic computation and algebraic computation, Matrix algebra, Polynomials, Polynomial system solving, 01 natural sciences, Boundary value problems, Complexity and performance of numerical algorithms, semi-linear parabolic problems, Homotopy algorithms, symbolic methods, Stationary solutions, Computational aspects of field theory and polynomials, 0101 mathematics, Semi-linear parabolic problems, Mathematical models, Numerical Analysis, Algebra and Number Theory, Applied Mathematics, Complexity, polynomial systems, Partial differential equations, Global methods, including homotopy approaches to the numerical solution of nonlinear equations, Real polynomials: location of zeros, Computational complexity, Semi linear parabolic problems, Set theory, complexity, Algorithms, homotopy methods, Conditioning
File Description: application/xml; application/pdf
Access URL: https://zbmath.org/2201763
https://doi.org/10.1016/j.jco.2004.09.008
https://dblp.uni-trier.de/db/journals/jc/jc21.html#LeoDM05
https://www.sciencedirect.com/science/article/pii/S0885064X04001086
https://core.ac.uk/display/82166302
https://www.sciencedirect.com/science/article/abs/pii/S0885064X04001086
https://www.sciencedirect.com/science/article/pii/S0885064X04001086#!
http://hdl.handle.net/20.500.12110/paper_0885064X_v21_n4_p502_DeLeo -
18
Authors:
Source: Journal of Mathematical Modelling and Algorithms. 1:169-180
Subject Terms: Computational methods for sparse matrices, Complexity and performance of numerical algorithms, Numerical algorithms for specific classes of architectures, Analysis of algorithms and problem complexity, banded triangular systems, parallel algorithms, Parallel numerical computation, ring topology, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, complexity, 01 natural sciences
File Description: application/xml
Access URL: https://link.springer.com/article/10.1023/A%3A1020586405464
https://experts.illinois.edu/en/publications/designing-optimal-algorithms -for-solving-banded-triangular-system
https://dblp.uni-trier.de/db/journals/jmma/jmma1.html#SantosSS02
https://doi.org/10.1023/A:1020586405464 -
19
Authors: Victor Y. Pan
Source: SIAM Journal on Computing. 30:1080-1125
Subject Terms: polynomial gcd, computational complexity, Analysis of algorithms and problem complexity, randomized algorithms, displacement rank, Other matrix algorithms, parallel algorithms, 0102 computer and information sciences, block Gauss-Jordan decomposition, 01 natural sciences, Complexity and performance of numerical algorithms, Grammars and rewriting systems, Toeplitz operators, Hankel operators, Wiener-Hopf operators, \(p\)-adic lifting, Parallel algorithms in computer science, Toeplitz-like matrices, Newton-Hensel's lifting, 0101 mathematics, Toeplitz matrix computations
File Description: application/xml
-
20
Authors: Eunice E. Santos
Source: The Journal of Supercomputing. 25:155-175
Subject Terms: 0301 basic medicine, 0303 health sciences, Analysis of algorithms and problem complexity, matrix multiplication, Other matrix algorithms, Symbolic computation and algebraic computation, algorithms, LogP model, lower bounds, 03 medical and health sciences, Complexity and performance of numerical algorithms, parallel models, scientific computing, parallel complexity, distributed-memory computers, parallel computation
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science