...
首页> 外文期刊>RAIRO Operation Research >LIMITED MEMORY SOLUTION OF BOUND CONSTRAINED CONVEX QUADRATIC PROBLEMS ARISING IN VIDEO GAMES
【24h】

LIMITED MEMORY SOLUTION OF BOUND CONSTRAINED CONVEX QUADRATIC PROBLEMS ARISING IN VIDEO GAMES

机译:视频游戏中有界约束的凸二次问题的有限内存解

获取原文
获取原文并翻译 | 示例
           

摘要

We describe the solution of a bound constrained convex quadratic problem with limited memory resources. The problem arises from physical simulations occurring within video games. The motivating problem is outlined, along with a simple interior point approach for its solution. Various linear algebra issues arising in the implementation are explored, including preconditioning, ordering and a number of ways of solving an equivalent augmented system. Alternative approaches are briefly surveyed, and some recommendations for solving these types of problems are given.
机译:我们描述了有限的内存资源的有界约束凸二次问题的解决方案。该问题来自视频游戏中发生的物理模拟。概述了激励问题,并提供了一种简单的内部点方法来解决。探索了在实现中出现的各种线性代数问题,包括预处理,排序和解决等效增强系统的多种方法。简要调查了替代方法,并给出了解决此类问题的一些建议。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号