期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到263,467篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
DDoS Attack Tracking Using Multi-Round Iterative Viterbi Algorithm in Satellite Internet 认领 引用 被引量：1
1
作者 Guo Wei Xu Jin +2 位作者 Pei Yukui Yin Liuguo Feng Wei 《China Communications》 SCIE EI CSCD 2025年第3期148-163,共16页
Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ... Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI. 展开更多
关键词 DDoS tracking iterative Viterbi algorithm satellite Internet 6G
暂未订购 下载PDF
Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system 认领 引用 被引量：3
2
作者 程生毅 刘文劲 +3 位作者 陈善球 董理治 杨平 许冰 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第8期391-397,共7页
Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltage... Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. 展开更多
关键词 adaptive optics iterative wavefront control algorithm direct gradient wavefront control algorithm
暂未订购 下载PDF
Improved gradient iterative algorithms for solving Lyapunov matrix equations 认领 引用 被引量：1
3
作者 顾传青 范伟薇 《Journal of Shanghai University(English Edition)》 2008年第5期395-399,共5页
In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared wi... In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples. 展开更多
关键词 gradient iterative （GI） algorithm improved gradient iteration （GI） algorithm Lyapunov matrix equations convergence factor
暂未订购 下载PDF
3D Seismic Data Reconstruction based on Weighted Fast Iterative Shrinkage Thresholding algorithm 认领 引用
4
作者 Zhang Hua Qiu Da-Xing +3 位作者 Mo Zi-Fen Hao Ya-Ju Wu Zhao-Qi Dai Meng-Xue 《Applied Geophysics》 SCIE CSCD 2025年第1期22-34,231,232,共13页
Data reconstruction is a crucial step in seismic data preprocessing.To improve reconstruction speed and save memory,the commonly used three-dimensional(3D)seismic data reconstruction method divides the missing data in... Data reconstruction is a crucial step in seismic data preprocessing.To improve reconstruction speed and save memory,the commonly used three-dimensional(3D)seismic data reconstruction method divides the missing data into a series of time slices and independently reconstructs each time slice.However,when this strategy is employed,the potential correlations between two adjacent time slices are ignored,which degrades reconstruction performance.Therefore,this study proposes the use of a two-dimensional curvelet transform and the fast iterative shrinkage thresholding algorithm for data reconstruction.Based on the significant overlapping characteristics between the curvelet coefficient support sets of two adjacent time slices,a weighted operator is constructed in the curvelet domain using the prior support set provided by the previous reconstructed time slice to delineate the main energy distribution range,eff ectively providing prior information for reconstructing adjacent slices.Consequently,the resulting weighted fast iterative shrinkage thresholding algorithm can be used to reconstruct 3D seismic data.The processing of synthetic and field data shows that the proposed method has higher reconstruction accuracy and faster computational speed than the conventional fast iterative shrinkage thresholding algorithm for handling missing 3D seismic data. 展开更多
关键词 data reconstruction fast iterative shrinkage thresholding prior support set weighted operator
暂未订购 下载PDF
Geometrically Nonlinear Deformation Reconstruction Based on iQS4 Elements Using a Linearized Iterative iFEM Algorithm 认领 引用 被引量：4
5
作者 Mengying Li Dawei Jia +2 位作者 He Huang Ziyan Wu Adnan Kefal 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2023年第1期166-180,共15页
Structural shape monitoring plays a vital role in the structural health monitoring systems.The inverse finite element method(iFEM)has been demonstrated to be a practical method of deformation reconstruction owing to i... Structural shape monitoring plays a vital role in the structural health monitoring systems.The inverse finite element method(iFEM)has been demonstrated to be a practical method of deformation reconstruction owing to its unique advantages.Current iFEM formulations have been applied to small deformation of structures based on the small-displacement assumption of linear theory.However,this assumption may be inapplicable to some structures with large displacements in practical applications.Therefore,geometric nonlinearity needs to be considered.In this study,to expand the practical utility of iFEM for large displacement monitoring,we propose a nonlinear iFEM algorithm based on a four-node inverse quadrilateral shell element iQS4.Taking the advantage of an iterative iFEM algorithm,a nonlinear response is linearized to compute the geometrically nonlinear deformation reconstruction,like the basic concept of nonlinear FE analysis.Several examples are solved to verify the proposed approach.It is demonstrated that large displacements can be accurately estimated even if the in-situ sensor data includes different levels of randomly generated noise.It is proven that the nonlinear iFEM algorithm provides a more accurate displacement response as compared to the linear iFEM methodology for structures undergoing large displacement.Hence,the proposed approach can be utilized as a viable tool to effectively characterize geometrically nonlinear deformations of structures in real-time applications. 展开更多
关键词 Deformation reconstruction iQS4 element Iterative algorithm Nonlinear iFEM Geometric nonlinearity
暂未订购 下载PDF
Iterative Algorithm of Steered Minimum Variance and Its Application in Weak Targets Detection 认领 引用 被引量：3
6
作者 朱代柱 李关防 +2 位作者 惠俊英 陈阳 黄雯华 《Journal of Shanghai Jiaotong university(Science)》 EI 2010年第6期694-701,共8页
The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineeri... The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix,an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors,and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target's azimuth even when the source powers differ in large scales or their bearings are very approximate. 展开更多
关键词 beamforming steered minimum variance (STMV) iterative algorithm computational cost weak target detection
暂未订购 下载PDF
Jointly-check iterative decoding algorithm for quantum sparse graph codes 认领 引用 被引量：2
7
作者 邵军虎 白宝明 +1 位作者 林伟 周林 《Chinese Physics B》 SCIE EI CAS 2010年第8期116-122,共7页
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ... For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement. 展开更多
关键词 quantum error correction sparse graph code iterative decoding belief-propagation algorithm
暂未订购 下载PDF
Fast parallel algorithm for three-dimensional distance-driven model in iterative computed tomography reconstruction 认领 引用 被引量：1
8
作者 陈建林 李磊 +5 位作者 王林元 蔡爱龙 席晓琦 张瀚铭 李建新 闫镔 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第2期513-520,共8页
The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterat... The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction. 展开更多
关键词 computed tomography iterative reconstruction parallelizable algorithm distance-driven model
暂未订购 下载PDF
ITERATIVE ALGORITHM FOR AXIALLY ACCELERATING STRINGS WITH INTEGRAL CONSTITUTIVE LAW 认领 引用 被引量：2
9
作者 Weijia Zhao Liqun Chen 《Acta Mechanica Solida Sinica》 SCIE EI 2008年第5期449-456,共8页
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is ... A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed. 展开更多
关键词 iterative algorithm partial-differential-integral equation Hermite function Galerkin method axially moving string integral constitutive law
暂未订购 下载PDF
AN ITERATIVE ALGORITHM FOR MAXIMAL MONOTONE MULTIVALUED OPERATOR EQUATIONS 认领 引用 被引量：1
10
作者 Xiao Jinsheng Sun Lelin 《Acta Mathematica Scientia》 SCIE 2001年第2期152-158,共7页
A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the ... A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the algorithm is discussed and all example is given. 展开更多
关键词 Iterative algorithm maximal monotone operator multivalued operator
暂未订购 下载PDF
AN ITERATIVE ALGORITHM FOR OPTIMAL DESIGN OF NON-FREQUENCY-SELECTIVE FIR DIGITAL FILTERS 认领 引用 被引量：1
11
作者 Tian Xinguang Duan Miyi +1 位作者 Sun Chunlai Liu Xin 《Journal of Electronics(China)》 2008年第5期667-672,共6页
This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization conc... This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm. 展开更多
关键词 Finite Impulse Response （FIR） digital filters Optimal design Windowing method Approximation error Iterative algorithm
暂未订购 下载PDF
Iterative quantum algorithm for distributed clock synchronization 认领 引用
12
作者 王洪福 张寿 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第10期110-114,共5页
Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubit... Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O（n） messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm. 展开更多
关键词 clock synchronization iterative algorithm
暂未订购 下载PDF
An iterative algorithm for solving a class of matrix equations 认领 引用
13
作者 Minghui WANG Yan FENG 《控制理论与应用（英文版）》 2009年第1期68-72,共5页
In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration s... In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2]. 展开更多
关键词 Iterative algorithm Conjugate gradient method Lyapunov matrix equation Sylvester matrix equation
暂未订购 下载PDF
Almost sure T-stability and convergence for random iterative algorithms 认领 引用
14
作者 张石生 王雄瑞 +1 位作者 刘敏 朱浸华 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2011年第6期805-810,共6页
The purpose of this paper is to study the almost sure T-stability and convergence of Ishikawa-type and Mann-type random iterative algorithms for some kind of C-weakly contractive type random operators in a separable B... The purpose of this paper is to study the almost sure T-stability and convergence of Ishikawa-type and Mann-type random iterative algorithms for some kind of C-weakly contractive type random operators in a separable Banach space. Under suitable conditions, the Bochner integrability of random fixed points for this kind of random operators and the almost sure T-stability and convergence for these two kinds of random iterative algorithms are proved. 展开更多
关键词 almost sure T-stability separable Banach space Bochner integrability,Ishikawa-type random iterative scheme Mann-type random iterative scheme
暂未订购 下载PDF
Dimension-down iterative algorithm for the mixed transportation network design problem 认领 引用
15
作者 陈群 姚加林 《Journal of Southeast University(English Edition)》 EI CAS 2012年第2期236-239,共4页
An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programmin... An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm. 展开更多
关键词 mixed network design problem （MNDP） dimension-down iterative algorithm （DDIA） mathematical programming with equilibrium constraint （MPEC）
暂未订购 下载PDF
A Correntropy-based Affine Iterative Closest Point Algorithm for Robust Point Set Registration 认领 引用 被引量：7
16
作者 Hongchen Chen Xie Zhang +2 位作者 Shaoyi Du Zongze Wu Nanning Zheng 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2019年第4期981-991,共11页
The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this prob... The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments. 展开更多
关键词 Affine iterative closest point(ICP)algorithm correntropy-based robust point set registration
暂未订购 下载PDF
An Iterative Compensation Algorithm for Springback Control in Plane Deformation and Its Application 认领 引用 被引量：2
17
作者 Rui Ma Chunge Wang +1 位作者 Ruixue Zhai Jun Zhao 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2019年第2期212-223,共12页
In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite... In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite element simulation is an e ective method to predict the springback of complex shape parts, but its precision is sensitive to the simulation model, particularly material model and boundary conditions. In this paper, the simple iterative method is introduced to establish the iterative compensation algorithm, and the convergence criterion of iterative parameters is put forward. In addition, the new algorithm is applied to the V-free bending and stretch-bending processes, and the convergence of curvature and bending angle is proved theoretically and verified experimentally. At the same time,the iterative compensation experiments for plane bending show that, the new method can predict the next compensaantido tnh ev atlaureg ebta cseurdv oatnu trhe ew sitphri tnhgeb earcrko ro fo fe laecshs ttehsat,n s0 o. 5 th%a ta rteh eo btatraigneet db aefntedri n2 g-3 a nitgelrea tiwoitnhs.t Thhei se rrreosre aorf clhe sps rtohpaons e±s 0 a.1%new iterative compensation algorithm to predict springback in sheet metal forming process, where each compensation value depends only on the iteration parameter di erence before and after springback for the same forming process of same material. 展开更多
关键词 Springback control Iterative compensation algorithm Convergence criterion V-free bending Stretchbending
暂未订购 下载PDF
Iterative algorithm for solutions to new system of generalized mixed implicit equilibrium 认领 引用
18
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2013年第1期113-126,共14页
A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium pro... A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem （AMEP） is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems （SGEP） is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field. 展开更多
关键词 system of generalized mixed implicit equilibrium problems （SGMIEP）,auxiliary mixed equilibrium problem （AMEP） system of generalized equation problems（SGEP） iterative algorithm reflexive Banach space
暂未订购 下载PDF
New regularization method and iteratively reweighted algorithm for sparse vector recovery 认领 引用 被引量：2
19
作者 Wei ZHU Hui ZHANG Lizhi CHENG 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2020年第1期157-172,共16页
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design... Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm. 展开更多
关键词 regularization method iteratively reweighted algorithm(IR-algorithm) sparse vector recovery
暂未订购 下载PDF
ITERATIVE ALGORITHMS FOR FINDING APPROXIMATE SOLUTIONS OF COMPLETELY GENERALIZED STRONGLY NONLINEAR QUASIVARIATIONAL INEQUALITIES 认领 引用
20
作者 曾六川 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1994年第11期1069-1080,共12页
In this paper, we study, iterative algorithms.for finding approximate solutions ofcompletely generalized strongly nonlinear quasivariational inequalities which include,as a special case, some known results in this .fi... In this paper, we study, iterative algorithms.for finding approximate solutions ofcompletely generalized strongly nonlinear quasivariational inequalities which include,as a special case, some known results in this .field. Our results are the extension andimprovents of the results of Siddiqi and Ansari, Ding. and Zeng. 展开更多
关键词 quasivariational inequality iterative scheme convergence ofalgorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈