{"id":11174,"date":"2014-01-02T23:51:16","date_gmt":"2014-01-02T21:51:16","guid":{"rendered":"http:\/\/hgpu.org\/?p=11174"},"modified":"2014-01-02T23:51:16","modified_gmt":"2014-01-02T21:51:16","slug":"optimal-polygonal-l1-linearization-and-fast-interpolation-of-nonlinear-systems","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=11174","title":{"rendered":"Optimal polygonal L1 linearization and fast interpolation of nonlinear systems"},"content":{"rendered":"<p>The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. We propose a principled and practical technique to linearize and evaluate arbitrary continuous nonlinear functions using polygonal (continuous piecewise linear) models under the L1 norm. A thorough error analysis is developed to guide an optimal design of two kinds of polygonal approximations in the asymptotic case of a large budget of evaluation subintervals N. The method allows the user to obtain the level of linearization (N) for a target approximation error and vice versa. It is suitable for, but not limited to, an efficient implementation in modern Graphics Processing Units (GPUs), allowing real-time performance of computationally demanding applications. The quality and efficiency of the technique has been measured in detail on the Gaussian function because it is a nonlinear function extensively used in many areas of scientific computing and it is expensive to evaluate.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. We propose a principled and practical technique to linearize and evaluate arbitrary continuous nonlinear functions using polygonal (continuous piecewise linear) models under the L1 norm. A thorough error analysis is developed to guide an optimal design of two [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[89,157,3],"tags":[14,1796,628,20,974,298],"class_list":["post-11174","post","type-post","status-publish","format-standard","hentry","category-nvidia-cuda","category-mathematics","category-paper","tag-cuda","tag-mathematics","tag-numerical-analysis","tag-nvidia","tag-nvidia-geforce-gtx-580","tag-optimization"],"views":2333,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/11174","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=11174"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/11174\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11174"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=11174"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=11174"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}