QQ客服 官方微博 反馈留言

	A numerical iterative scheme for computing finite order rank-one convex envelopes
	Wang, Xin ; Li, Zhiping
	2007
关键词	finite order rank-one convex envelope laminated microstructure iterative scheme interpolation VARIATIONAL-PROBLEMS OPTIMAL-DESIGN RELAXATION MICROSTRUCTURES COMPUTATION
英文摘要	It is known that the ith order laminated microstructures can be resolved by the kth order rank-one convex envelopes with k >= i. So the requirement of establishing an efficient numerical scheme for the computation of the finite order rank-one convex envelopes arises. In this paper, we develop an iterative scheme for such a purpose. The first order rank-one convex envelope R(1)f is approximated by evaluating its value on matrixes at each grid point in R-mn and then extend to non-grid points by interpolation. The approximate kth order rank-one convex envelope R(k)f is obtained iteratively by computing the approximate first order rank-one convex envelope of the numerical approximation of R(k-1)f Compared with O(h(1/3)) obtained so far for other methods, the optimal convergence rate O(h) is established for our scheme, and numerical examples illustrate the computational efficiency of the scheme. (c) 2006 Elsevier Inc. All rights reserved.; Mathematics, Applied; SCI(E); EI; 1; ARTICLE; 1; 19-30; 185
语种	英语
出处	EI ; SCI
出版者	applied mathematics and computation
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/250334]
专题	数学科学学院
推荐引用方式 GB/T 7714	Wang, Xin,Li, Zhiping. A numerical iterative scheme for computing finite order rank-one convex envelopes. 2007-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。