找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Numerical Analysis and Its Applications; Second International Lubin Vulkov,Plamen Yalamov,Jerzy Waśniewski Conference proceedings 2001 Spri

[复制链接]
楼主: 有作用
发表于 2025-3-26 23:02:45 | 显示全部楼层
On Solving Large-Scale Weighted Least Squares Problemssparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We discuss a technique for forming low-rank correction preconditioners for such problems. Finally we give numerical results to illustrat
发表于 2025-3-27 01:31:25 | 显示全部楼层
发表于 2025-3-27 08:25:37 | 显示全部楼层
Inexact Newton Methods and Mixed Nonlinear Complementary Problemshe linearized systems are solved with two preconditioners particularly suited for parallel computation. We report the results for the solution of some nonlinear problems on the CRAY T3E under the MPI environment. Our methods may be used to solve more general problems. Due to the presence of a logari
发表于 2025-3-27 10:31:00 | 显示全部楼层
发表于 2025-3-27 17:24:56 | 显示全部楼层
New Families of Symplectic Runge-Kutta-Nyström Integration Methodsusly known algorithms. The methods use the processing technique and non-trivial flows associated with different elements of the Lie algebra involved in the problem. Both the processor and the kernel are compositions of explicitly computable maps.
发表于 2025-3-27 18:56:39 | 显示全部楼层
Convergence of Finite Difference Method for Parabolic Problem with Variable Operator assume that the solution of the problem and the coefficients of equation belong to the corresponding anisotropic Sobolev spaces. Convergence rate estimates consistent with the smoothness of the data are obtained.
发表于 2025-3-27 23:32:34 | 显示全部楼层
发表于 2025-3-28 03:48:39 | 显示全部楼层
发表于 2025-3-28 07:37:07 | 显示全部楼层
Fractional Step Runge-Kutta Methods for the Resolution of Two Dimensional Time Dependent Coefficient in the numerical resolution of parabolic problems whose coefficients depend on time. These methods combined with standard spatial discretizations will provide totally discrete algorithms with low computational cost and high order of accuracy in time. We will show the efficiency of such methods, in
发表于 2025-3-28 11:03:49 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 19:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表