Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Information Technology --- Life Sciences --- Mathematical Sciences --- Telecommunications Technology --- General and Others --- Computational Biosciences --- Algorithms --- Applied Mathematics --- Graph Theory --- Communication Networks & Technology --- graph algorithms --- algorithm engineering --- graph drawing --- network visualization --- computational geometry
Choose an application
Numerical methods are a specific form of mathematics that involve creating and use of algorithms to map out the mathematical core of a practical problem. Numerical methods naturally find application in all fields of engineering, physical sciences, life sciences, social sciences, medicine, business, and even arts. The common uses of numerical methods include approximation, simulation, and estimation, and there is almost no scientific field in which numerical methods do not find a use. Results communicated here include topics ranging from statistics (Detecting Extreme Values with Order Statistics in Samples from Continuous Distributions) and Statistical software packages (dCATCH—A Numerical Package for d-Variate near G-Optimal Tchakaloff Regression via Fast NNLS) to new approaches for numerical solutions (Exact Solutions to the Maxmin Problem max‖Ax‖ Subject to ‖Bx‖≤1; On q-Quasi-Newton’s Method for Unconstrained Multiobjective Optimization Problems; Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method; On Derivative Free Multiple-Root Finders with Optimal Fourth Order Convergence; Finite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations) to the use of wavelets (Orhonormal Wavelet Bases on The 3D Ball Via Volume Preserving Map from the Regular Octahedron) and methods for visualization (A Simple Method for Network Visualization).
Research & information: general --- Mathematics & science --- Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver --- Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver
Choose an application
This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014. The 29 full papers presented together with 3 invited talks were carefully reviewed and selected from 62 submissions. The papers are organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings.
Computer science. --- Computer software. --- Computational complexity. --- Algebra --- Computer graphics. --- Algorithms. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Math Applications in Computer Science. --- Symbolic and Algebraic Manipulation. --- Computer Graphics. --- Computer science --- Computer graphics --- Algorithms --- Computer algorithms --- Engineering & Applied Sciences --- Computer Science --- Data processing. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Algorism --- Complexity, Computational --- Software, Computer --- Informatics --- Mathematics. --- Algorithmische Geometrie. --- Algorithmus. --- Approximationsalgorithmus. --- Berechnungskomplexität. --- Graph. --- Graphenzeichnen. --- Arithmetic --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Science --- Foundations --- Digital techniques --- Algorithmen --- Computergeometrie --- Computational geometry --- Berechenbare Geometrie --- Geometrie-Algorithmen --- Geometrie --- Geometrische Modellierung --- Geometrieverarbeitung --- Graph Drawing --- Graphzeichnen --- Zeichnen --- Graphentheorie --- Computational complexity --- Berechenbarkeit --- Komplexität von Berechnungen --- Polynomiale Komplexität --- Komplexitätstheorie --- Approximation --- Approximation algorithm --- Algorithmus --- Komplexität --- Machine theory --- Computer systems --- Computer science—Mathematics. --- Discrete mathematics. --- Mathematical Applications in Computer Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Choose an application
Numerical methods are a specific form of mathematics that involve creating and use of algorithms to map out the mathematical core of a practical problem. Numerical methods naturally find application in all fields of engineering, physical sciences, life sciences, social sciences, medicine, business, and even arts. The common uses of numerical methods include approximation, simulation, and estimation, and there is almost no scientific field in which numerical methods do not find a use. Results communicated here include topics ranging from statistics (Detecting Extreme Values with Order Statistics in Samples from Continuous Distributions) and Statistical software packages (dCATCH—A Numerical Package for d-Variate near G-Optimal Tchakaloff Regression via Fast NNLS) to new approaches for numerical solutions (Exact Solutions to the Maxmin Problem max‖Ax‖ Subject to ‖Bx‖≤1; On q-Quasi-Newton’s Method for Unconstrained Multiobjective Optimization Problems; Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method; On Derivative Free Multiple-Root Finders with Optimal Fourth Order Convergence; Finite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations) to the use of wavelets (Orhonormal Wavelet Bases on The 3D Ball Via Volume Preserving Map from the Regular Octahedron) and methods for visualization (A Simple Method for Network Visualization).
Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver
Listing 1 - 4 of 4 |
Sort by
|