Algorithms for Approximation
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)
Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)

Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

This volume comprises the proceedings of the second Shrivenham conference on Algorithms for Approximation. The term 'approximation' here refers to 'the approximation of functions and data by similar functions', and leads to such topics as curve and surface fitting, spline and piecewise polynomial methods, finite element modelling, and computer-aided design. Applications are given to a wide variety of areas such as surveying, meteorology, radar antenna and acoustic array design, topography, engineering metrology, and CAD/CAM. Emphasis at the meeting was placed on the development of useful algorithms, and on practical applications in defence and industry. In addition, some 40 submitted papers were selected and presented on a multitude of topics such as multivariate interpolation, optimization methods, constrained problems, spline fitting, data modelling, and applications in microwave measurement, isotropic antennas, sound measurement, and digitized contours.

Table of Contents:
Part 1 Development of algorithms: spline approximation - constrained spline approximation of functions and data based on constrained knot removal, E.Arge et al, near real-time spline fitting of long sequences of uniformly spaced data, T.Anthony, an algorithm for knot location in bivariate least squares spline approximation, M.Bozzini and F.de Tisi, a knot placement strategy for least squares spline fitting based on the use of local polynomial approximations, M.G.Cox et al, an algorithm for nonlinear splines with non-negativity constraints, G.Opfer, spline curve fitting of digitized contours, C.Potier and C.Vercken, a B-spline approximation algorithm for quasi-interpolation or filtering, C.Rabut, on knots and nodes for spline interpolation, P.W.Smith - polynomial and piecewise polynomial approximation - a basis for certain spaces of multivariate polynomials and exponentials, W.Dahmen, monotone piecewise cubic data fitting, F.N.Fritsch, direct and converse results on simultaneous approximation by the method of Bermstein-Durrmeyer operators, M.Heilmann and M.W.Muller, orthogonality and approximation in a Sobolev space by A.Iserles et al, piecewise polynomial approximation of polynomial curves, M.A.Lachance, calculation of the energy of a piecewise polynomial surface, E.Quak and L.L.Schumaker; interpolation - radial basis function interpolation on an infinte regular grid, M.D.Buhmann and M.J.D.Powell, the Fourier operator of even order and site application to an extremum problem in interpolation, L.Brutman, on multivariate polynomial interpolation, N.Dyn and A.Ron, algorithms for the construction of data dependent triangulations, N.Dyn et al, algorithms for computing best parametric cubic interpolation, C.Rademacher and K. Scherer; smoothing and constraint methods - data fitting by penalized least squares, M.Von Golitschek and L.L.Schumaker, a semi-infinite programming algorithm for constrained best approximation, K.W.Bosworth, inference region for a method of local approximation by using the residuals, M.Bozzinio and L.Lenarduzzi; complex approximation. (Part contents)


Best Sellers


Product Details
  • ISBN-13: 9780412345807
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: CRC Press
  • Language: English
  • No of Pages: 532
  • Series Title: Chapman Hall/CRC Mathematics Series
  • Weight: 794 gr
  • ISBN-10: 0412345803
  • Publisher Date: 15 May 1990
  • Binding: Hardback
  • No of Pages: 532
  • Returnable: N
  • Sub Title: 2


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)
Taylor & Francis Ltd -
Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)
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.

Algorithms for Approximation: 2(Chapman Hall/CRC Mathematics Series)

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!