Search - iteration

Search - iteration - List

[SCM] 单片机子程序库 DL : 0: 目前已有若干版本的子程序库公开发表，它们各有特色。本程序库中的开平方算法为快速逼近算法，它能达到牛顿迭代法同样的精度，而速度加快二十倍左右，超过双字节定点除法的速度.-there are several versions of the subroutine library published their own characteristics. The library opened in the square approximation algorithm for rapid algorithm, it will reach Newton iteration of the same accuracy, while speed about 20 times, more than double byte sentinel division speed.
Date : 2026-01-01 Size : 3kb User : 王辉
[SCM] squareroot DL : 0: 单片机上的开方程序比传统的牛顿迭代法要快-microcontroller on the prescribing process than the traditional Newton iteration to be fast
Date : 2026-01-01 Size : 2kb User : 王宝成
[SCM] 51library DL : 0: 《ＭＣＳ－５１单片机实用子程序库（９６年版）》周航慈目前已有若干版本的子程序库公开发表，它们各有特色。笔者在1988年也编制了两个子程序库（定点子程序库和浮点子程库），并在相容性、透明性、容错性和算法优化方面作了一些工作。本程序库中的开平方算法为笔者研究的快速逼近算法，它能达到牛顿迭代法同样的精度，而速度加快二十倍左右，超过双字节定点除法的速度。经过八年来全国广大用户的实际使用，反馈了不少信息，陆续扩充了一些新的子程序，纠正了一些隐含错误，成为现在这个最新版本。（转）-"MCS-51 microcontroller practical Subroutine Library (96)" Hang Zhou chee There are a number of versions of the son the procedure is published their own characteristics. The author in 1988 also produced two subroutine library (fixed-point and floating-point subroutine library son-Treasurer), and compatibility, transparent, fault tolerance and optimization algorithm has done some work. The procedures for the open square algorithm for the rapid study author approximation algorithm, it will reach Newton iteration of the same precision, and the speed around 20 times, more than double byte sentinel division of speed. After eight years of the country's actual use of user feedback a lot of information, gradually expanding the number of new subroutine, corrected some mistakes implied
Date : 2026-01-01 Size : 61kb User : 鹿艺凡
[SCM] mcukpfkssf DL : 0: 因为工作的需要，要在单片机上实现开根号的操作。目前开平方的方法大部分是用牛顿迭代法。我在查了一些资料以后找到了一个比牛顿迭代法更加快速的方法。不敢独享，介绍给大家，希望会有些帮助。-Because the work needs to realize single-chip on the operation of open radical sign. Square root of the current methods are mostly used Newton iteration. I checked some information in the future than to find a more rapid Newton iteration method. Dare not exclusive, Introduction to the U.S., hoping it might be useful.
Date : 2026-01-01 Size : 4kb User : gw
[SCM] MCUKAIFANG DL : 0: 因为工作的需要，要在单片机上实现开根号的操作。目前开平方的方法大部分是用牛顿迭代法。我在查了一些资料以后找到了一个比牛顿迭代法更加快速的方法。不敢独享，介绍给大家，希望会有些帮助。-Because the needs of work, to achieve single-chip open radical operation. Square root of the current methods are mostly used Newton iteration. I checked some information in the future than to find a more rapid Newton iteration method. Dare not exclusive to introduce to you the hope that it might be useful.
Date : 2026-01-01 Size : 1kb User : zhongxinyu
[SCM] square_root DL : 0: 单片机开平方的快速算法比牛顿迭代法更加快速-Single-chip square root of the fast algorithm for more than Newton iteration Express
Date : 2026-01-01 Size : 1kb User : 谭仲书
[SCM] chengxu DL : 1: 常用的单片机子程序库：目前已有若干版本的子程序库公开发表,它们各有特色。本程序库中的开平方算法为快速逼近算法,它能达到牛顿迭代法同样的精度,而速度加快二十倍左右,超过双字节定点除法的速度。-Single-chip common subroutine library: there are a number of versions of the subroutine library published, they have their own characteristics. Library in the square root algorithm for fast approximation algorithm that can achieve the same Newton iteration accuracy, and about twenty times faster, more than double the speed of fixed-point division.
Date : 2026-01-01 Size : 15kb User : zhy
[SCM] DeblurringImagesUsingtheBlindDeconvolutionAlgorit DL : 0: The Blind Deconvolution Algorithm can be used effectively when no information about the distortion (blurring and noise) is known. The algorithm restores the image and the point-spread function (PSF) simultaneously. The accelerated, damped Richardson-Lucy algorithm is used in each iteration. Additional optical system (e.g. camera) characteristics can be used as input parameters that could help to improve the quality of the image restoration. PSF constraints can be passed in through a user-specified function
Date : 2026-01-01 Size : 3kb User : ayla
[SCM] An_efficient_Chase_decoder_for_turbo_product_code DL : 0: Abstract—In this letter, we propose an efficient decoding algorithm for turbo product codes as introduced by Pyndiah. The proposed decoder has no performance degradation and reduces the complexity of the original decoder by an order of magnitude. We concentrate on extended Bose–Chaudhuri–Hocquengem codes as the constituent row and column codes because of their already low implementation complexity. For these component codes, we observe that the weight and reliability factors can be fixed, and that there is no need for normalization. Furthermore, as opposed to previous efficient decoders, the newly proposed decoder naturally scales with a test-pattern parameter that can change as a function of iteration number, i.e., the efficient Chase algorithm presented here uses conventionally ordered test patterns, and the syndromes, even parities, and extrinsic metrics are obtained with a minimum number of operations.
Date : 2026-01-01 Size : 93kb User : cordic
[SCM] pid DL : 0: 名称：PID.C 功能：用PID算法闭环控制BANGK3区DAC0832的输出电压，通过设置想要的输出电压，它通过ADC0804将O832的输出电压读回单片机进行PID自动调节，并经过短时间将DAC0832的输出电压升到设置的电压说明：此程序用的是位置式调节 -PID Function The PID (比例、积分、微分) function is used in mainly control applications. PIDCalc performs one iteration of the PID algorithm. While the PID function works, main is just a dummy program showing a typical usage.
Date : 2026-01-01 Size : 2kb User :
[SCM] PIEZO DL : 0: 16C54睡眠例程 WRITTEN BY NIGEL GARDNER COPYRIGHT BLUEBIRD ELECTRONICS - 01 380 725110 DATE 3/7/95 ITERATION 1.0 FILE SAVED AS PIEZO.ASM FOR PIC16C5x CLOCK any portb equ 6 #define RC portb,0 rc time constant for testing first time power up org 00 ****** initialize ****** init clrf portb movlw 0fh portb lower 4 bits as inputs tris portb btfss RC test for first pass sleep yes first time main program continues here on after a wakeup from sleep as opposed to the first time through. ***** reset vector ****** org 1ffh for 16c54/55 goto init start programme here ! end - WRITTEN BY NIGEL GARDNER COPYRIGHT BLUEBIRD ELECTRONICS- 01 380 725110 DATE 3/7/95 ITERATION 1.0 FILE SAVED AS PIEZO.ASM FOR PIC16C5x CLOCK any portb equ 6 #define RC portb,0 rc time constant for testing first time power up org 00 ****** initialize****** init clrf portb movlw 0fh portb lower 4 bits as inputs tris portb btfss RC test for first pass sleep yes first time main program continues here on after a wakeup from sleep as opposed to the first time through. ***** reset vector ****** org 1ffh for 16c54/55 goto init start programme here ! end
Date : 2026-01-01 Size : 1kb User : 马家添
[SCM] 51assembly-language DL : 0: MCS-51单片机实用子程序库，本程序库中的开平方算法为笔者研究的快速逼近算法，它能达到牛顿迭代法同样的精度，而速度加快二十倍左右，超过双字节定点除法的速度。经过八年来全国广大用户的实际使用，反馈了不少信息，陆续扩充了一些新的子程序，纠正了一些隐含错误，成为现在这个最新版本。-MCS-51 single-chip utility subroutine library, the library of the square root algorithm for fast approximation algorithm for the author the study, it can achieve the same precision Newton iteration, which is about twenty times faster, than double-byte fixed-point division speed. After eight years of actual use of the vast number of users, a lot of feedback information, have expanded the number of new routines to correct some wrong implied Mistakenly become now this latest version.
Date : 2026-01-01 Size : 8kb User : 郝为
[SCM] 018_sd DL : 0: 发觉立牌坊健康帕克极品轧空皮肤干击破复古uijcjdofpj -Having determined that the minimum iteration interval is 1, you can initiate a new iteration every cycle. You can schedule LDW (or LDDW) and MPY (or MPYSP) instructions on every cycle
Date : 2026-01-01 Size : 5.93mb User : wanjianjun
[SCM] Nelder DL : 0: We can now compare the convergence speeds and iteration numbers of the methods. Since Lagrange Multiplier Method and Sequential Linear Programming Method include manual calculations elapsed time comparison is not applicable for them. There is also another important point. In Nelder and Mead Method although the code output for iteration number is 2 it is different in reality. We used while function in the code this repeats the calculations and does not affect the iteration number. On the other hand elapsed time of codes give us enough information to compare the codes. -We can now compare the convergence speeds and iteration numbers of the methods. Since Lagrange Multiplier Method and Sequential Linear Programming Method include manual calculations elapsed time comparison is not applicable for them. There is also another important point. In Nelder and Mead Method although the code output for iteration number is 2 it is different in reality. We used while function in the code this repeats the calculations and does not affect the iteration number. On the other hand elapsed time of codes give us enough information to compare the codes.
Date : 2026-01-01 Size : 1kb User : Volkan
[SCM] trans_f DL : 0: By comparing elapsed times one can say that Hooke and Jeeves methods converge faster than other methods and the slowest one seems to be Nelder and Mead Simplex Method. In this part of the assignment we are going to reach the solution by using Nelder and Mead Simplex method. Note that the starting simplex points are given. We also have reflection, contraction, expansion and scaling parameters. Inspecting the results given in Table 1 one can say that the elapsed time is low (the code is working smoothly) and iteration number is acceptable. Both step sizes and their norm is in the allowed range. Final or optimized R, t and weight values are really close to the results that we have obtained in Homework III. As a results we can deduct that we accomplished a good optimization problem solution by using Hooke and Jeeves method.-By comparing elapsed times one can say that Hooke and Jeeves methods converge faster than other methods and the slowest one seems to be Nelder and Mead Simplex Method. In this part of the assignment we are going to reach the solution by using Nelder and Mead Simplex method. Note that the starting simplex points are given. We also have reflection, contraction, expansion and scaling parameters. Inspecting the results given in Table 1 one can say that the elapsed time is low (the code is working smoothly) and iteration number is acceptable. Both step sizes and their norm is in the allowed range. Final or optimized R, t and weight values are really close to the results that we have obtained in Homework III. As a results we can deduct that we accomplished a good optimization problem solution by using Hooke and Jeeves method.
Date : 2026-01-01 Size : 1kb User : Volkan
[SCM] exatj DL : 0: The title of the commercial is undergraduate course you Jacobi iteration for solving linear equations class-based, Codec ldpc code implementatio.
Date : 2026-01-01 Size : 5kb User : tfeaivu
[SCM] yc842 DL : 0: Of spherical harmonics graphic simulation, BP neural network function fitting and pattern recognition, Jacobi iteration for solving linear equations class-based.
Date : 2026-01-01 Size : 5kb User : kengmaitieman
[SCM] ve730 DL : 0: On neural network control, IDW inverse distance weighting method, Jacobi iteration for solving linear equations class-based.
Date : 2026-01-01 Size : 6kb User : fennanning
[SCM] hk632 DL : 0: Fiber Transmission wireless communication system performance, Much posture, multi-angle, have different light, Jacobi iteration for solving linear equations class-based.
Date : 2026-01-01 Size : 10kb User : baimenhiu
[SCM] demo2 DL : 0: LMS算法是随机梯度算法中的一种，其在随机输入维纳滤波器递归计算中使用确定性梯度。(It is one of random gradient algorithms with the steady gradient during the iteration)
Date : 2026-01-01 Size : 1kb User : 雪狼女

« 12 »