Algorithms for Bound Constrained Quadratic Programming Problems.
Algorithms for cardinal interpolation using box splines and radial basis functions.
Algorithms for Computing Shape Preserving Spline Approximations to Data.
Algorithms for Confluent Vandermonde Systems.
Algorithms for Evaluation of the Wright Function for the Real Arguments’ Values
2000 Math. Subject Classification: 33E12, 65D20, 33F05, 30E15The paper deals with analysis of several techniques and methods for the numerical evaluation of the Wright function. Even if the focus is mainly on the real arguments’ values, the methods introduced here can be used in the complex plane, too. The approaches presented in the paper include integral representations of the Wright function, its asymptotic expansions and summation of series. Because the Wright function depends on two parameters ...
Algorithms for Lambda-Matrices.
Algorithms for Optimal Design with Application to Multiple Polynomial Regression.
Algorithms for solution of equations and resulting in Lyapunov stability analysis of linear systems
Algorithms for the inclusion of solutions of ordinary initial value problems
Algorithms for the matrix sector function.
Algorithms in Unnormalized Arithmetic. II. Unrestricted Polynomial Evaluation.
Algorithms of common solutions to generalized mixed equilibrium problems and a system of quasivariational inclusions for two difference nonlinear operators in Banach spaces.
Algoritmy. 46. COR. Lineární regresní polynom s vedlejší podmínkou
Algoritmy na výpočet kořenů polynomu
Algunos aspectos numéricos de la ecuación deiferencial de Duffing
Alguns teoremas sobre a equivalência do problema do caixeiro viajante múltiplo ao problema do caixeiro viajante
All Bézier curves are attractors of iterated function systems.
All-at-once preconditioning in PDE-constrained optimization
The optimization of functions subject to partial differential equations (PDE) plays an important role in many areas of science and industry. In this paper we introduce the basic concepts of PDE-constrained optimization and show how the all-at-once approach will lead to linear systems in saddle point form. We will discuss implementation details and different boundary conditions. We then show how these system can be solved efficiently and discuss methods and preconditioners also in the case when bound...
Almost curvature continuous fitting of B-spline surfaces.
Almost Hermitian trigonometric interpolation on three equidistant nodes.