z-logo
open-access-imgOpen Access
Efficient Basis Change for Sparse-Grid Interpolating Polynomials with Application to T-Cell Sensitivity Analysis
Author(s) -
Gregery T. Buzzard
Publication year - 2013
Publication title -
computational biology journal
Language(s) - English
Resource type - Journals
eISSN - 2314-4173
pISSN - 2314-4165
DOI - 10.1155/2013/562767
Subject(s) - sobol sequence , sensitivity (control systems) , sparse grid , interpolation (computer graphics) , mathematics , grid , basis (linear algebra) , representation (politics) , lagrange polynomial , sparse approximation , diagonal , polynomial , basis function , orthogonal polynomials , algorithm , matrix (chemical analysis) , mathematical optimization , computer science , combinatorics , mathematical analysis , geometry , artificial intelligence , motion (physics) , electronic engineering , politics , law , political science , engineering , materials science , composite material
Sparse-grid interpolation provides good approximations to smooth functions in high dimensions based on relatively few function evaluations, but in standard form it is expressed in Lagrange polynomials. Here, we give a block-diagonal factorization of the basis-change matrix to give an efficient conversion of a sparse-grid interpolant to a tensored orthogonal polynomial (or gPC) representation. We describe how to use this representation to give an efficient method for estimating Sobol' sensitivity coefficients and apply this method to analyze and efficiently approximate a complex model of T-cell signaling events

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom