期刊文献+
共找到1,466篇文章
< 1 2 74 >
每页显示 20 50 100
Parameter estimation for chaotic systems using the cuckoo search algorithm with an orthogonal learning method 被引量:14
1
作者 李向涛 殷明浩 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第5期113-118,共6页
We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to es... We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to estimate the parameters of chaotic systems.This algorithm can combine the stochastic exploration of the cuckoo search and the exploitation capability of the orthogonal learning strategy.Experiments are conducted on the Lorenz system and the Chen system.The proposed algorithm is used to estimate the parameters for these two systems.Simulation results and comparisons demonstrate that the proposed algorithm is better or at least comparable to the particle swarm optimization and the genetic algorithm when considering the quality of the solutions obtained. 展开更多
关键词 cuckoo search algorithm chaotic system parameter estimation orthogonal learning
原文传递
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm 被引量:10
2
作者 Hong Li Li Zhang Yongchang Jiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期443-451,共9页
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith... An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm. 展开更多
关键词 integer linear bilevel programming problem integer optimization genetic algorithm orthogonal experiment design
在线阅读 下载PDF
Orthogonal genetic algorithm for solving quadratic bilevel programming problems 被引量:4
3
作者 Hong Li Yongchang Jiao Li Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第5期763-770,共8页
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker(KKT) conditions.To cope with the complementarity constraints,a binary encod... A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker(KKT) conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations. 展开更多
关键词 orthogonal genetic algorithm quadratic bilevel programming problem Karush-Kuhn-Tucker conditions orthogonal experimental design global optimal solution.
在线阅读 下载PDF
BLIND EQUALIZATION OF MIMO SYSTEMS BASED ON ORTHOGONAL CONSTANT MODULUS ALGORITHM 被引量:1
4
作者 Shi Kun Zhang Xudong 《Journal of Electronics(China)》 2006年第2期181-183,共3页
This paper investigates adaptive blind source separation and equalization for Multiple Input Multiple Output (MIMO) systems. To effectively recover input signals, remove Inter-Symbol Interference (ISI) and suppress In... This paper investigates adaptive blind source separation and equalization for Multiple Input Multiple Output (MIMO) systems. To effectively recover input signals, remove Inter-Symbol Interference (ISI) and suppress Inter-User Interference (IUI), the array input is first transformed into the signal subspace, then with the derived orthogonality between weight vectors of different input signals, a new orthogonal Constant Modulus Algorithm (CMA) is proposed. Computer simulation results illustrate the promising performance of the proposed method. Without channel identification, the proposed method can recover all the system inputs simultaneously and can be adaptive to channel changes without prior knowledge about signals. 展开更多
关键词 Multiple Input Multiple Output (MIMO) system Blind equalization Constant Modulus algorithm (CMA) orthogonalITY
在线阅读 下载PDF
Manufacturing Supply Chain Optimization Problem with Time Windows Based on Improved Orthogonal Genetic Algorithm
5
作者 ZHANG Xinhua (Information Management College,Shandong Economic University,Jinan 250014,China) 《武汉理工大学学报》 CAS CSCD 北大核心 2006年第S1期254-259,共6页
Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and ro... Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion,with the distribution algorithm driving the routing algorithm. At second,we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally,the examples suggest that this proposed approach is feasible,correct and valid. 展开更多
关键词 MANUFACTURING supply CHAIN TIME windows orthogonal GENETIC algorithm
在线阅读 下载PDF
Probability Simulation Optimization Approach Using Orthogonal Genetic Algorithm
6
作者 WANG Yinling XING Lining YAN Shiliang 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1481-1484,共4页
In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach sy... In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid. 展开更多
关键词 simulation optimization orthogonal genetic algorithm statistical test computer simulation optimization technology
在线阅读 下载PDF
AUTOMATIC ORTHOGONALIZATION DETECTION APPROACH FOR GS ALGORITHM
7
作者 肖丹 顾德仁 《Journal of Electronics(China)》 1995年第2期186-192,共7页
Gram-Schmidt orthogonalization algorithm is an interesting theme in the field of adaptive beam-forming and filtering as a fast algorithm. However, a key problem associated with this algorithm is that the number of ort... Gram-Schmidt orthogonalization algorithm is an interesting theme in the field of adaptive beam-forming and filtering as a fast algorithm. However, a key problem associated with this algorithm is that the number of orthogonalization, namely, the dimensions of interference subspace, is required to know prior. In this paper we derive a threshold and adopt it to detect the number of orthogonalization in the procedure of Gram-Schmidt(GS) orthogonalization decomposition, and this detection approach is simpler and faster than the approach based on eigenanalysis. Finally, computer simulation results were presented too. 展开更多
关键词 GS orthogonalIZATION algorithm ADAPTIVE FILTERING ADAPTIVE BEAM-FORMING
在线阅读 下载PDF
An Orthogonal Wavelet Transform Fractionally Spaced Blind Equalization Algorithm Based on the Optimization of Genetic Algorithm
8
作者 廖娟 郭业才 季童莹 《Defence Technology(防务技术)》 SCIE EI CAS 2011年第2期65-71,共7页
An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square er... An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square error and local convergence of traditional constant modulus blind equalization algorithm(CMA).The proposed algorithm can reduce the signal autocorrelation through the orthogonal wavelet transform of input signal of fractionally spaced blind equalizer,and decrease the possibility of CMA local convergence by using the global random search characteristics of genetic algorithm to optimize the equalizer weight vector.The proposed algorithm has the faster convergence rate and smaller mean square error compared with FSE and WT-FSE.The efficiency of the proposed algorithm is proved by computer simulation of underwater acoustic channels. 展开更多
关键词 information processing technique genetic algorithm orthogonal wavelet transform fractionally spaced equalizer blind equalization underwater acoustic channel
在线阅读 下载PDF
NON-LINEAR DYNAMIC MODEL RETRIEVAL OF SUBTROPICAL HIGH BASED ON EMPIRICAL ORTHOGONAL FUNCTION AND GENETIC ALGORITHM
9
作者 张韧 洪梅 +4 位作者 孙照渤 牛生杰 朱伟军 闵锦忠 万齐林 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2006年第12期1645-1653,共9页
Aiming at the difficulty of accurately constructing the dynamic model of subtropical high, based on the potential height field time series over 500 hPa layer of T106 numerical forecast products, by using EOF(empirica... Aiming at the difficulty of accurately constructing the dynamic model of subtropical high, based on the potential height field time series over 500 hPa layer of T106 numerical forecast products, by using EOF(empirical orthogonal function) temporal-spatial separation technique, the disassembled EOF time coefficients series were regarded as dynamical model variables, and dynamic system retrieval idea as well as genetic algorithm were introduced to make dynamical model parameters optimization search, then, a reasonable non-linear dynamic model of EOF time-coefficients was established. By dynamic model integral and EOF temporal-spatial components assembly, a mid-/long-term forecast of subtropical high was carried out. The experimental results show that the forecast results of dynamic model are superior to that of general numerical model forecast results. A new modeling idea and forecast technique is presented for diagnosing and forecasting such complicated weathers as subtropical high. 展开更多
关键词 genetic algorithm empirical orthogonal function non-linear model retrieval subtropical high
在线阅读 下载PDF
Schedule algorithm for mitigating inter-cell interference based on orthogonal complement space
10
作者 付少忠 葛建华 《Journal of Central South University》 SCIE EI CAS 2011年第2期499-503,共5页
In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule... In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule algorithm (DS-OCS) and distributed proportional fairness schedule algorithm (DPFS-OCS) based on orthogonal complement space (OCS) were proposed. The first right and left singular vectors of the channel that the user experienced were selected as the transmitting and receiving beamforming vectors. An interference space was spanned by the left singular vectors of the entire interference users in the same channel. The most suitable user lay in the OCS of the interference space was scheduled to avoid suffering interference from neighboring cells based on the criterion of system capacity maximizing and proportional fairness. The simulation results show that the average system capacity can be improved by 2%-4% compared with the DS-OCS algorithm with the Max C/I algorithm,by 6%-10% compared with the DPFS-OCS algorithm with the PF algorithm. 展开更多
关键词 long term evolution interference avoidance schedule algorithm orthogonal complement space FAIRNESS
在线阅读 下载PDF
Explicit structure-preserving geometric particle-in-cell algorithm in curvilinear orthogonal coordinate systems and its applications to whole-device 6D kinetic simulations of tokamak physics
11
作者 Jianyuan XIAO Hong QIN 《Plasma Science and Technology》 SCIE EI CAS CSCD 2021年第5期18-41,共24页
Explicit structure-preserving geometric particle-in-cell(PIC)algorithm in curvilinear orthogonal coordinate systems is developed.The work reported represents a further development of the structure-preserving geometric... Explicit structure-preserving geometric particle-in-cell(PIC)algorithm in curvilinear orthogonal coordinate systems is developed.The work reported represents a further development of the structure-preserving geometric PIC algorithm achieving the goal of practical applications in magnetic fusion research.The algorithm is constructed by discretizing the field theory for the system of charged particles and electromagnetic field using Whitney forms,discrete exterior calculus,and explicit non-canonical symplectic integration.In addition to the truncated infinitely dimensional symplectic structure,the algorithm preserves exactly many important physical symmetries and conservation laws,such as local energy conservation,gauge symmetry and the corresponding local charge conservation.As a result,the algorithm possesses the long-term accuracy and fidelity required for first-principles-based simulations of the multiscale tokamak physics.The algorithm has been implemented in the Sym PIC code,which is designed for highefficiency massively-parallel PIC simulations in modern clusters.The code has been applied to carry out whole-device 6 D kinetic simulation studies of tokamak physics.A self-consistent kinetic steady state for fusion plasma in the tokamak geometry is numerically found with a predominately diagonal and anisotropic pressure tensor.The state also admits a steady-state subsonic ion flow in the range of 10 km s-1,agreeing with experimental observations and analytical calculations Kinetic ballooning instability in the self-consistent kinetic steady state is simulated.It is shown that high-n ballooning modes have larger growth rates than low-n global modes,and in the nonlinear phase the modes saturate approximately in 5 ion transit times at the 2%level by the E×B flow generated by the instability.These results are consistent with early and recent electromagnetic gyrokinetic simulations. 展开更多
关键词 curvilinear orthogonal mesh charge-conservative PARTICLE-IN-CELL symplectic algorithm whole-device plasma simulation
在线阅读 下载PDF
The Algorithm of Balanced Orthogonal Multiwavelets and Its Application in Denoising
12
作者 QIU Ai-zhong 《International Journal of Plant Engineering and Management》 2011年第4期221-224,共4页
In order to extract fault features of a weak signal from the strong noise and maintain signal smoothness, a new method of denoising based on the algorithm of balanced orthogonal multiwavelets is proposed. Multiwavelet... In order to extract fault features of a weak signal from the strong noise and maintain signal smoothness, a new method of denoising based on the algorithm of balanced orthogonal multiwavelets is proposed. Multiwavelets have several scaling functions and wavelet functions, and possess excellent properties that a scalar wavelet cannot satisfy simultaneously, and match the different characteristics of signals. Moreover, the balanced orthogonal multiwavelets can avoid the Gibbs phenomena and their processes have the advantages in denoising. Therefore, the denoising based on the algorithm of balanced orthogonal multiwavelets is introduced into the signal process. The algorithm of bal- anced orthogonal multiwavelet and the implementation steps of this denoising are described. The experimental compar- ison of the denoising effect between this algorithm and the traditional multiwavelet algorithm was done. The experi- ments indieate that this method is effective and feasible to extract the fault feature submerged in heavy noise. 展开更多
关键词 balanced orthogonal multiwavelets wavelet algorithm signal denoising extracting signal features fault diagnosis
在线阅读 下载PDF
Polyphase orthogonal sequences design for opportunistic array radar via HGA 被引量:9
13
作者 Shufeng Gong Weijun Long +2 位作者 Hao Huang De Ben Minghai Pan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第1期60-67,共8页
Opportunistic array radar (OAR) is a new generation radar system based on the stealth of the platform, which can improve the modern radar performance effectively. Designing the orthogonal code sets with low autocorr... Opportunistic array radar (OAR) is a new generation radar system based on the stealth of the platform, which can improve the modern radar performance effectively. Designing the orthogonal code sets with low autocorrelation and cross-correlation is a key issue for OAR. This paper proposes a novel hybrid genetic algorithm (HGA) and designs the polyphase orthogonal code sets with low autocorrelation and cross-correlation properties, which can be used in the OAR system. The novel algorithm combines with simulated annealing (SA) and genetic algorithm (GA), adds in keeping best individuals and competition in small scope, and introduces grey correlation evaluation to evaluate fitness function. These avoid the premature convergence problem existed in GA and enhance the global searching capability. At last, the genetic results are optimized to obtain the best solution by using greedy algorithm. The simulation results show that the proposed algorithm is effective for the design of orthogonal phase signals used in OAR systems. 展开更多
关键词 hybrid genetic algorithm (HGA) grey correlation evaluation opportunistic array radar (OAR) orthogonal signal.
在线阅读 下载PDF
Orthogonal-Least-Squares Forward Selection for Parsimonious Modelling from Data 被引量:1
14
作者 Sheng CHEN 《Engineering(科研)》 2009年第2期55-74,共20页
The objective of modelling from data is not that the model simply fits the training data well. Rather, the goodness of a model is characterized by its generalization capability, interpretability and ease for knowledge... The objective of modelling from data is not that the model simply fits the training data well. Rather, the goodness of a model is characterized by its generalization capability, interpretability and ease for knowledge extraction. All these desired properties depend crucially on the ability to construct appropriate parsimonious models by the modelling process, and a basic principle in practical nonlinear data modelling is the parsimonious principle of ensuring the smallest possible model that explains the training data. There exists a vast amount of works in the area of sparse modelling, and a widely adopted approach is based on the linear-in-the-parameters data modelling that include the radial basis function network, the neurofuzzy network and all the sparse kernel modelling techniques. A well tested strategy for parsimonious modelling from data is the orthogonal least squares (OLS) algorithm for forward selection modelling, which is capable of constructing sparse models that generalise well. This contribution continues this theme and provides a unified framework for sparse modelling from data that includes regression and classification, which belong to supervised learning, and probability density function estimation, which is an unsupervised learning problem. The OLS forward selection method based on the leave-one-out test criteria is presented within this unified data-modelling framework. Examples from regression, classification and density estimation applications are used to illustrate the effectiveness of this generic parsimonious modelling approach from data. 展开更多
关键词 DATA MODELLING Regression Classification DENSITY Estimation orthogonal Least SQUARES algorithm
在线阅读 下载PDF
Design of Radial Basis Function Network Using Adaptive Particle Swarm Optimization and Orthogonal Least Squares 被引量:1
15
作者 Majid Moradi Zirkohi Mohammad Mehdi Fateh Ali Akbarzade 《Journal of Software Engineering and Applications》 2010年第7期704-708,共5页
This paper presents a two-level learning method for designing an optimal Radial Basis Function Network (RBFN) using Adaptive Velocity Update Relaxation Particle Swarm Optimization algorithm (AVURPSO) and Orthogonal Le... This paper presents a two-level learning method for designing an optimal Radial Basis Function Network (RBFN) using Adaptive Velocity Update Relaxation Particle Swarm Optimization algorithm (AVURPSO) and Orthogonal Least Squares algorithm (OLS) called as OLS-AVURPSO method. The novelty is to develop an AVURPSO algorithm to form the hybrid OLS-AVURPSO method for designing an optimal RBFN. The proposed method at the upper level finds the global optimum of the spread factor parameter using AVURPSO while at the lower level automatically constructs the RBFN using OLS algorithm. Simulation results confirm that the RBFN is superior to Multilayered Perceptron Network (MLPN) in terms of network size and computing time. To demonstrate the effectiveness of proposed OLS-AVURPSO in the design of RBFN, the Mackey-Glass Chaotic Time-Series as an example is modeled by both MLPN and RBFN. 展开更多
关键词 RADIAL BASIS Function Network orthogonal Least SQUARES algorithm Particle SWARM Optimization Mackey-Glass CHAOTIC Time-Series
在线阅读 下载PDF
GS-orthogonalization OMP method for space target detection via bistatic space-based radar 被引量:1
16
作者 Shuyu ZHENG Libing JIANG +2 位作者 Qingwei YANG Yingjian ZHAO Zhuang WANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2024年第7期333-351,共19页
A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and ... A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and it can detect focused space targets more flexibly than the monostatic radar system or the ground-based radar system.However,the target echo signal is more difficult to process due to the high-speed motion of both space-based radars and space targets.To be specific,it will encounter the problems of Range Cell Migration(RCM)and Doppler Frequency Migration(DFM),which degrade the long-time coherent integration performance for target detection and localization inevitably.To solve this problem,a novel target detection method based on an improved Gram Schmidt(GS)-orthogonalization Orthogonal Matching Pursuit(OMP)algorithm is proposed in this paper.First,the echo model for bistatic space-based radar is constructed and the conditions for RCM and DFM are analyzed.Then,the proposed GS-orthogonalization OMP method is applied to estimate the equivalent motion parameters of space targets.Thereafter,the RCM and DFM are corrected by the compensation function correlated with the estimated motion parameters.Finally,coherent integration can be achieved by performing the Fast Fourier Transform(FFT)operation along the slow time direction on compensated echo signal.Numerical simulations and real raw data results validate that the proposed GS-orthogonalization OMP algorithm achieves better motion parameter estimation performance and higher detection probability for space targets detection. 展开更多
关键词 Bistatic space-based radar High-speed maneuvering space targets detection Range Cell Migration(RCM) Doppler Frequency Migration(DFM) Gram Schmidt(GS)-orthogonalization orthogonal Matching Pursuit(OMP)algorithm
原文传递
Performance analysis and code recognition for dual N-ary orthogonal hybrid modulation systems
17
作者 乔晓强 Zhao Hangsheng Cai Yueming 《High Technology Letters》 EI CAS 2008年第2期113-117,共5页
A dual N-ary orthogonal hybrid modulation system is introduced in this paper, which can increase the data rate greatly compared with conventional N-ary orthogonal spread spectrum system, so it can be used for high rat... A dual N-ary orthogonal hybrid modulation system is introduced in this paper, which can increase the data rate greatly compared with conventional N-ary orthogonal spread spectrum system, so it can be used for high rate data communication. Then, three code recognition algorithms are presented for dual N-ary orthogonal hybrid modulation system and the analytic bit error rate (BER) performance of the system in additive white Gaussian noise (AWGN) and fiat Rayleigh fading channel is derived. Finally, the computer simulation of the system with three code recognition algorithms is performed, which shows that the simplified maximum a posteriori (MAP) algorithm is the best for the system with a compromise between the performance and the complexity. 展开更多
关键词 code recognition N-ary orthogonal spread spectrum hybrid modulation MAP (maxi-mum a posteriori) algorithm
在线阅读 下载PDF
分块Gram-Schmidt正交化算法及其应用 被引量:3
18
作者 赵韬 姜金荣 《中国科学院研究生院学报》 CAS CSCD 北大核心 2009年第2期224-229,共6页
Gram-Schmidt正交化算法是数值线性代数中的基本算法之一,主要用于计算矩阵QR分解.经典和修正Gram-Schmidt正交化算法基于level1/2BLAS运算,低级BLAS运算对cache的利用率比较低,从而限制了算法性能.提出一种新的分块Gram-Schmidt正交化... Gram-Schmidt正交化算法是数值线性代数中的基本算法之一,主要用于计算矩阵QR分解.经典和修正Gram-Schmidt正交化算法基于level1/2BLAS运算,低级BLAS运算对cache的利用率比较低,从而限制了算法性能.提出一种新的分块Gram-Schmidt正交化算法.新算法通过重正交保证产生矩阵Q的正交性达到机器精度,并且利用level3BLAS运算提高了算法性能.数值试验表明,新算法能使得矩阵Q的正交性达到机器精度,并且新算法使得性能得到显著提高. 展开更多
关键词 gram-schmidt Arnoldi算法 正交化 分块算法 QR分解
在线阅读 下载PDF
基于Gram-Schmidt正交化算法的水下目标回波检测 被引量:2
19
作者 许江湖 张明敏 《海军工程大学学报》 CAS 北大核心 2006年第1期89-93,共5页
提出了一种基于Gram-Schmidt正交化算法的水下目标回波检测方法.该方法利用Gram-Schmidt正交化算法实现对干扰背景的预白化,通过归一化匹配滤波器可完成对水下目标回波的检测.对仿真数据和实验数据的处理验证了该方法的有效性.
关键词 Gram—Schmidt正交化算法 水下目标检测 归-化匹配滤波器
在线阅读 下载PDF
基于Gram-Schmidt正交法的矩阵并行QR分解算法 被引量:4
20
作者 黄丽嫦 黄润 《佛山科学技术学院学报(自然科学版)》 CAS 2013年第3期44-47,共4页
分析了线性无关向量组的Gram-Schmidt正交化过程以及矩阵的QR分解原理。在多核架构的微机中,设计实现了一种基于Gram-Schmidt正交法的矩阵QR多核并行分解算法。新算法易于计算机编程实现,数值实验也验证了算法具有良好的并行性。
关键词 Gram—Schmidt正交法 QR分解 多核并行计算
在线阅读 下载PDF
上一页 1 2 74 下一页 到第
使用帮助 返回顶部