Numerical Computations: Theory and Algorithms by Yaroslav D. Sergeyev
Home > Computer & Internet > Computer programming / software development > Compilers > Numerical Computations: Theory and Algorithms
Numerical Computations: Theory and Algorithms

Numerical Computations: Theory and Algorithms


     0     
5
4
3
2
1



International Edition


About the Book

Approximation: Methods, Algorithms, and Applications.- Towards an Efficient Implementation of an Accurate SPH Method.- A Procedure for Laplace Transform Inversion Based on Smoothing Exponential-Polynomial.- Splines.- An Adaptive Refinement Scheme for Radial Basis Function Collocation.- A 3D efficient Procedure for Shepard Interpolants on Tetrahedra.- Interpolation by Bivariate Quadratic Polynomials and Applications to the Scattered Data Interpolation Problem.- Comparison of Shepard's Like Methods with Different Basis Functions.- A New Remez-type Algorithm for Best Polynomial Approximation.- An SVE Approach for the Numerical Solution of Ordinary Differential Equations.- Uniform Weighted Approximation by Multivariate Filtered Polynomials.- Computational Methods for Data Analysis.- A Travelling Wave Solution for Nonlinear Colloid Facilitated Mass Transport in Porous Media.- Performance Analysis of a Multicore Implementation for Solving a Two-dimensional Inverse Anomalous Diffusion Problem.- Adaptive RBF Interpolation for Estimating Missing Values in Geographical Data.- Stochastic Mechanisms of Information Flow in Phosphate Economy of Escherichia Coli.- NMR Data Analysis of Water Mobility in Wheat Flour Dough: A Computational Approach.- First Order Methods in Optimization: Theory and Applications.- A Limited Memory Gradient Projection Method for Box-Constrained Quadratic Optimization.- Problems.- A Gradient-Based Globalization Strategy for the Newton Method.- On the Steplength Selection in Stochastic Gradient Methods.- Efficient Block Coordinate Methods for Blind Cauchy Denoising.- High Performance Computing in Modelling and Simulation.- A Parallel Software Platform for Pathway Enrichment.- Hierarchical Clustering of Spatial Urban Data.- Improving Efficiency in Parallel Computing Leveraging Local Synchronization.- A General Computational Formalism for Networks of Structured Grids.- Preliminary Model of Saturated.- Flow Using Cellular Automata.- A Cybersecurity Framework for Classifying Non Stationary Data Streams Exploiting Genetic Programming and Ensemble Learning.- A Dynamic Load Balancing Technique for Parallel Execution of Structured Grid Models.- Final Sediment Outcome from Meteorological Flood Events: A Multi-Modelling Approach.- Parallel Algorithms for Multifractal Analysis of River Networks.- A Methodology Approach to Compare Performance of Parallel Programming Models for.- Shared-Memory Architectures.- Numbers, Algorithms, and Applications.- New Approaches to Basic Calculus: An Experimentation via Numerical Computation.- A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola.- Paradoxes of the Infinite and Ontological Dilemmas between Ancient Philosophy and Modern Mathematical Solutions.- The Sequence of Carboncettus Octagons.- On the Arithmetic of Knuth's Powers and Some Computational Results about Their Density.- Combinatorics on n-sets: Arithmetic Properties and Numerical Results.- Numerical Problems in XBRL Reports and the Use of Blockchain as Trust Enabler.- Modelling on Human Intelligence a Machine Learning System.- Algorithms for Jewelry Industry 4.0.- Clustering Analysis to Profile Customers' Behaviour in POWER CLOUD Energy Community.- A Grossone-based Numerical Model for Computations with Infinity: A Case Study in an Italian High School.- A Computational Approach with MATLAB Software for Nonlinear Equation Roots Finding in High School Maths.- Task Mathematical Modelling Design in a Dynamic Geometry Environment: Archimedean Spiral's Algorithm.- Optimization and Management of Water Supply.- Numerical Experimentations for a New Set of Local Indices of a Water Network.- Performance Management of Demand and Pressure Driven Analysis in a Monitored Water.- Distribution Network.- Algebraic Tools and New Local Indices for Water Networks: Some Numerical Examples.- Identification of Contamination Potential Source (ICPS): A Topologica


Best Sellers



Product Details
  • ISBN-13: 9783030390808
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 622
  • Spine Width: 33 mm
  • Weight: 942 gr
  • ISBN-10: 3030390802
  • Publisher Date: 14 Feb 2020
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: Third International Conference, Numta 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part I
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Numerical Computations: Theory and Algorithms
Springer International Publishing -
Numerical Computations: Theory and Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Numerical Computations: Theory and Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!